001468064 000__ 06333cam\\2200697\i\4500
001468064 001__ 1468064
001468064 003__ OCoLC
001468064 005__ 20230707003352.0
001468064 006__ m\\\\\o\\d\\\\\\\\
001468064 007__ cr\cn\nnnunnun
001468064 008__ 230523s2023\\\\sz\a\\\\o\\\\\101\0\eng\d
001468064 020__ $$a9783031327261$$q(electronic bk.)
001468064 020__ $$a3031327268$$q(electronic bk.)
001468064 020__ $$z9783031327254
001468064 0247_ $$a10.1007/978-3-031-32726-1$$2doi
001468064 035__ $$aSP(OCoLC)1379802598
001468064 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dEBLCP
001468064 049__ $$aISEA
001468064 050_4 $$aT57.74
001468064 08204 $$a519.7/7$$223/eng/20230523
001468064 1112_ $$aConference on Integer Programming and Combinatorial Optimization$$n(24th :$$d2023 :$$cMadison, Wis.).
001468064 24510 $$aInteger programming and combinatorial optimization :$$b24th international conference, IPCO 2023, Madison, WI, USA, June 21-23, 2023, proceedings /$$cAlberto Del Pia, Volker Kaibel, editors.
001468064 24630 $$aIPCO 2023
001468064 264_1 $$aCham :$$bSpringer,$$c[2023]
001468064 264_4 $$c©2023
001468064 300__ $$a1 online resource (xiii, 482 pages) :$$billustrations (some color).
001468064 336__ $$atext$$btxt$$2rdacontent
001468064 337__ $$acomputer$$bc$$2rdamedia
001468064 338__ $$aonline resource$$bcr$$2rdacarrier
001468064 4901_ $$aLecture notes in computer science,$$x1611-3349 ;$$v13904
001468064 500__ $$aInternational conference proceedings.
001468064 500__ $$aIncludes author index.
001468064 5050_ $$aIntro -- Preface -- Organization -- Contents -- Information Complexity of Mixed-Integer Convex Optimization -- 1 First-order Information Complexity -- 1.1 Our Results -- 1.2 Formal Definitions and Statement of Results -- 1.3 Discussion and Future Avenues -- 2 Proof Sketches -- 2.1 Proof Sketch of Theorem 1 -- 2.2 Proof of Theorem 3 -- 2.3 Proof Sketch of Theorem 5 -- 2.4 Proof Sketch of Theorems 2 and 4 -- References -- Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products -- 1 Introduction -- 2 RLT for Bilinear Products -- 3 Detection of Implicit Products
001468064 5058_ $$a4 Separation Algorithm -- 4.1 Row Marking -- 4.2 Projection Filtering -- 5 Computational Results -- 5.1 Setup -- 5.2 Impact of RLT Cuts -- 5.3 Separation -- 5.4 Experiments with Gurobi -- 5.5 Summary -- References -- A Nearly Optimal Randomized Algorithm for Explorable Heap Selection -- 1 Introduction -- 2 The Explorable Heap Selection Problem -- 3 A New Algorithm -- 3.1 The Algorithm -- 3.2 Proof of Correctness -- 3.3 Running Time Analysis -- 3.4 Space Complexity Analysis -- 4 Lower Bound -- References -- Sparse Approximation over the Cube -- 1 Introduction and Literature Review
001468064 5058_ $$a2 Preliminaries -- 3 The l1-Relaxation for Random Targets b -- 4 Proximity Between Optimal Solutions of ([P0]P0) and ([P1]P1) -- 5 A Deterministic Algorithm -- 6 Extension -- References -- Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty -- 1 Introduction -- 2 Recycling Valid Inequalities -- 3 Facet-Defining Recycled Inequalities -- 4 Computational Study -- 4.1 Robust Independent Set -- 4.2 Robust Bipartite Matching -- 5 Conclusion -- References -- Inapproximability of Shortest Paths on Perfect Matching Polytopes -- 1 Introduction -- 1.1 Our Result
001468064 5058_ $$a1.2 Pivot Rules for Circuit-Augmentation Algorithms -- 1.3 Related Works -- 2 Proof of Theorem 1 -- 2.1 Preliminaries -- 2.2 Reduction -- 2.3 Proof of Lemma 3 -- References -- Monoidal Strengthening and Unique Lifting in MIQCPs -- 1 Introduction -- 2 Monoidal Strengthening in the Homogeneous Case -- 3 Monoidal Strengthening in the Non-homogeneous Case -- 3.1 A Technical Consideration for Sg -- 3.2 Monoid Construction -- 4 Solving the Monoidal Strengthening Problem -- 5 Unique Lifting -- 6 Computational Results -- References -- From Approximate to Exact Integer Programming -- 1 Introduction
001468064 5058_ $$a1.1 Contributions of This Paper -- 1.2 Related Work -- 2 Preliminaries -- 3 The Cut-Or-Average Algorithm -- 3.1 Bounding the Number of Iterations -- 3.2 Correctness and Efficiency of Subroutines -- 3.3 Conclusion on the Cut-Or-Average Algorithm -- 4 An Asymmetric Approximate Carathéodory Theorem -- 5 IPs with Polynomial Variable Range -- References -- Optimizing Low Dimensional Functions over the Integers -- 1 Introduction -- 1.1 Applications -- 1.2 Overview of Techniques -- 2 Non-negative Variables -- 3 Bounded Variables
001468064 506__ $$aAccess limited to authorized users.
001468064 520__ $$aThis book constitutes the refereed proceedings of the 24th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2023, held in Madison, WI, USA, during June 21–23, 2023. The 33 full papers presented were carefully reviewed and selected from 119 submissions. IPCO is under the auspices of the Mathematical Optimization Society, and it is an important forum for presenting present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.
001468064 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed May 23, 2023).
001468064 650_0 $$aInteger programming$$vCongresses.
001468064 650_0 $$aCombinatorial optimization$$vCongresses.
001468064 655_0 $$aElectronic books.
001468064 655_7 $$aConference papers and proceedings.$$2lcgft
001468064 7001_ $$aDel Pia, Alberto,$$eeditor.
001468064 7001_ $$aKaibel, Volker,$$eeditor.
001468064 830_0 $$aLecture notes in computer science ;$$v13904.$$x1611-3349
001468064 852__ $$bebk
001468064 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-32726-1$$zOnline Access$$91397441.1
001468064 909CO $$ooai:library.usi.edu:1468064$$pGLOBAL_SET
001468064 980__ $$aBIB
001468064 980__ $$aEBOOK
001468064 982__ $$aEbook
001468064 983__ $$aOnline
001468064 994__ $$a92$$bISE