top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings / / edited by Francisco Chicano, Bin Hu, Pablo García-Sánchez
Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings / / edited by Francisco Chicano, Bin Hu, Pablo García-Sánchez
Edizione [1st ed. 2016.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Descrizione fisica 1 online resource (XII, 267 p. 59 illus., 1 illus. in color.)
Disciplina 519.64
Collana Theoretical Computer Science and General Issues
Soggetto topico Numerical analysis
Algorithms
Computer science—Mathematics
Discrete mathematics
Computer science
Artificial intelligence
Numerical Analysis
Discrete Mathematics in Computer Science
Theory of Computation
Artificial Intelligence
ISBN 3-319-30698-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A Hybrid Constructive Mat-Heuristic Algorithm for The Heterogeneous Vehicle Routing Problem with Simultaneous Pick-up and Delivery -- A Property Preserving Method for Extending a Single-Objective Problem Instance to Multiple Objectives with Specific Correlations -- An Evolutionary Approach to the Full Optimization of the Traveling Thief Problem -- Construct, Merge, Solve & Adapt: Application to the Repetition-Free Longest Common Subsequence Problem -- Deconstructing the Big Valley Search Space Hypothesis -- Determining the Difficulty of Landscapes by PageRank Centrality in Local Optima Networks -- Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization -- Evaluating Hyperheuristics and Local Search Operators for Periodic Routing Problems -- Evolutionary Algorithms for Finding Short Addition Chains: Going the Distance -- Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems -- Hyperplane Elimination for Quickly Enumerating Local Optima -- Limits to Learning in Reinforcement Learning Hyperheuristics -- Modifying Colourings between Time-Steps to Tackle Changes in Dynamic Random Graphs -- Particle Swarm Optimisation with Sequence-Like Indirect Representation for Web Service Composition -- Particle Swarm Optimization for Multi-Objective Web Service Location Allocation -- Sim-EDA: A Multipopulation Estimation of Distribution Algorithm Based on Problem Similarity -- Solving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization. .
Record Nr. UNINA-9910483305103321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Exact and heuristic methods in combinatorial optimization : a study on the linear ordering and the maximum diversity problem / / Rafael Martí and Gerhard Reinelt
Exact and heuristic methods in combinatorial optimization : a study on the linear ordering and the maximum diversity problem / / Rafael Martí and Gerhard Reinelt
Autore Martí Rafael (Rafael Cunquero)
Edizione [2nd ed.]
Pubbl/distr/stampa Berlin, Germany : , : Springer, , [2022]
Descrizione fisica 1 online resource (232 pages)
Disciplina 519.64
Collana Applied Mathematical Sciences
Soggetto topico Sequences (Mathematics)
Mathematical optimization
Optimització combinatòria
Successions (Matemàtica)
Soggetto genere / forma Llibres electrònics
ISBN 3-662-64877-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910552731503321
Martí Rafael (Rafael Cunquero)  
Berlin, Germany : , : Springer, , [2022]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Exact and heuristic methods in combinatorial optimization : a study on the linear ordering and the maximum diversity problem / / Rafael Martí and Gerhard Reinelt
Exact and heuristic methods in combinatorial optimization : a study on the linear ordering and the maximum diversity problem / / Rafael Martí and Gerhard Reinelt
Autore Martí Rafael (Rafael Cunquero)
Edizione [2nd ed.]
Pubbl/distr/stampa Berlin, Germany : , : Springer, , [2022]
Descrizione fisica 1 online resource (232 pages)
Disciplina 519.64
Collana Applied Mathematical Sciences
Soggetto topico Sequences (Mathematics)
Mathematical optimization
Optimització combinatòria
Successions (Matemàtica)
Soggetto genere / forma Llibres electrònics
ISBN 3-662-64877-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996466418403316
Martí Rafael (Rafael Cunquero)  
Berlin, Germany : , : Springer, , [2022]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Facets of combinatorial optimization : festschrift for Martin Grotschel / / Michael Junger, Gerhard Reinelt, editors
Facets of combinatorial optimization : festschrift for Martin Grotschel / / Michael Junger, Gerhard Reinelt, editors
Edizione [1st ed. 2013.]
Pubbl/distr/stampa Heidelberg, Germany : , : Springer, , 2013
Descrizione fisica 1 online resource (xvii, 506 pages) : illustrations (some color), portrait
Disciplina 003.3
519.6
519.64
Collana Gale eBooks
Soggetto topico Combinatorial optimization
ISBN 3-642-38189-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Martin Grötschel - a tribute: M.Jünger and G.Reinelt.- Facets and rank of integer polyhedra: M.Padberg.- Constructing extended formulations from reflection relations: V.Kaibel and K.Pashkovich -- Exact algorithms for combinatorial optimization problems with submodular objective functions: F.Baumann, S.Berckey, and C.Buchheim -- Solving k-way graph partitioning problems to optimality: The impact of semidefinite relaxations and the bundle method: M.F. Anjos, B.Ghaddar, L.Hupp, F.Liers and A.Wiegele -- Mirror-descent methods in mixed-integer convex optimization: M.Baes, T.Oertel, Ch.Wagner and R.Weismantel -- On perspective functions and vanishing constraints in mixed-integer nonlinear optimal control: M.Jung, Ch.Kirches, and S.Sager -- Beyond perfection: computational results for superclasses: A.Pecher and A.Wagler -- Algorithms for junctions in acyclic graphs: C.E. Ferreira and A.J.P. Franco -- A primal heuristic for nonsmooth mixed integer nonlinear optimization: M.Schmidt, M.C. Steinbach, and B.M. Willert -- Flow-Over-Flow Models and an Application to the Scheduling and Routing of Fly-in Safari Planes: A.Fügenschuh, G.Nemhauser, and Y.Zeng -- How Many Steiner Terminals Can You Connect in 20 Years?: R.Borndörfer, N -- D.Hoang, M.Karbstein, Th.Koch, and A.Martin -- Robust heaviest connected subgraphs in networks: E.Alvarez Miranda, I.Ljubic, and P.Mutzel.- Algorithms for scheduling sensors to maximize coverage time: R.da Ponte Barbosa and Y.Wakabayashi -- From vertex-telecenters to subtree-telecenters: Z.Win and C.Kyi Than -- A new algorithm for MINLP applied to gas transport energy cost minimization: B.Geißler, A.Morsi and L.Schewe -- Progress in academic computational integer programming: Th.Koch, A.Martin, and M.E. Pfetsch -- Mixed Integer Programming: Analyzing 12 Years of Progress: T.Achterberg and R.Wunderling .
Record Nr. UNINA-9910438027203321
Heidelberg, Germany : , : Springer, , 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Generalized Network Design Problems : Modeling and Optimization / / Petrica C. Pop
Generalized Network Design Problems : Modeling and Optimization / / Petrica C. Pop
Autore Pop Petrica C.
Pubbl/distr/stampa Berlin ; ; Boston : , : De Gruyter, , [2012]
Descrizione fisica 1 online resource (216 p.)
Disciplina 519.64
Collana De Gruyter Series in Discrete Mathematics and Applications
Soggetto topico Computer networks -- Design and construction -- Mathematical models
Linear programming
Combinatorial optimization - Design and construction - Mathematical models
Computer networks
Soggetto genere / forma Electronic books.
ISBN 1-283-85668-9
3-11-026768-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Front matter -- Contents -- Chapter 1. Introduction -- Chapter 2. The Generalized Minimum Spanning Tree Problem (GMSTP) -- Chapter 3. The Generalized Traveling Salesman Problem (GTSP) -- Chapter 4. The Railway Traveling Salesman Problem (RTSP) -- Chapter 5. The Generalized Vehicle Routing Problem (GVRP) -- Chapter 6. The Generalized Fixed-Charge Network Design Problem (GFCNDP) -- Chapter 7. The Generalized Minimum Edge-Biconnected Network Problem (GMEBCNP) -- Bibliography -- Index
Record Nr. UNINA-9910462642403321
Pop Petrica C.  
Berlin ; ; Boston : , : De Gruyter, , [2012]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Generalized Network Design Problems : Modeling and Optimization / / Petrica C. Pop
Generalized Network Design Problems : Modeling and Optimization / / Petrica C. Pop
Autore Pop Petrica C.
Pubbl/distr/stampa Berlin ; ; Boston : , : De Gruyter, , [2012]
Descrizione fisica 1 online resource (216 p.)
Disciplina 519.64
Collana De Gruyter Series in Discrete Mathematics and Applications
Soggetto topico Computer networks -- Design and construction -- Mathematical models
Linear programming
Combinatorial optimization - Design and construction - Mathematical models
Computer networks
Soggetto non controllato Generalized Network Designed Problem
Heuristic Algorithm, Metaheuristic Algorithm
Integer Programming
Network Design Problem
Network Design
Optimization
ISBN 1-283-85668-9
3-11-026768-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Front matter -- Contents -- Chapter 1. Introduction -- Chapter 2. The Generalized Minimum Spanning Tree Problem (GMSTP) -- Chapter 3. The Generalized Traveling Salesman Problem (GTSP) -- Chapter 4. The Railway Traveling Salesman Problem (RTSP) -- Chapter 5. The Generalized Vehicle Routing Problem (GVRP) -- Chapter 6. The Generalized Fixed-Charge Network Design Problem (GFCNDP) -- Chapter 7. The Generalized Minimum Edge-Biconnected Network Problem (GMEBCNP) -- Bibliography -- Index
Record Nr. UNINA-9910786435103321
Pop Petrica C.  
Berlin ; ; Boston : , : De Gruyter, , [2012]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Generalized Network Design Problems : Modeling and Optimization / / Petrica C. Pop
Generalized Network Design Problems : Modeling and Optimization / / Petrica C. Pop
Autore Pop Petrica C.
Edizione [1st ed.]
Pubbl/distr/stampa Berlin ; ; Boston : , : De Gruyter, , [2012]
Descrizione fisica 1 online resource (216 p.)
Disciplina 519.64
Collana De Gruyter Series in Discrete Mathematics and Applications
Soggetto topico Computer networks -- Design and construction -- Mathematical models
Linear programming
Combinatorial optimization - Design and construction - Mathematical models
Computer networks
Soggetto non controllato Generalized Network Designed Problem
Heuristic Algorithm, Metaheuristic Algorithm
Integer Programming
Network Design Problem
Network Design
Optimization
ISBN 1-283-85668-9
3-11-026768-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Front matter -- Contents -- Chapter 1. Introduction -- Chapter 2. The Generalized Minimum Spanning Tree Problem (GMSTP) -- Chapter 3. The Generalized Traveling Salesman Problem (GTSP) -- Chapter 4. The Railway Traveling Salesman Problem (RTSP) -- Chapter 5. The Generalized Vehicle Routing Problem (GVRP) -- Chapter 6. The Generalized Fixed-Charge Network Design Problem (GFCNDP) -- Chapter 7. The Generalized Minimum Edge-Biconnected Network Problem (GMEBCNP) -- Bibliography -- Index
Record Nr. UNINA-9910808191303321
Pop Petrica C.  
Berlin ; ; Boston : , : De Gruyter, , [2012]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Integer programming and combinatorial optimization : 23rd international conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, proceedings / / edited by Karen Aardal and Laura Sanità
Integer programming and combinatorial optimization : 23rd international conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, proceedings / / edited by Karen Aardal and Laura Sanità
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2022]
Descrizione fisica 1 online resource (469 pages)
Disciplina 519.64
Collana Lecture Notes in Computer Science
Soggetto topico Combinatorial optimization
ISBN 3-031-06901-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Organization -- Contents -- Total Dual Dyadicness and Dyadic Generating Sets -- 1 Introduction -- 1.1 Totally Dual p-adic Systems and p-adic Generating Sets -- 1.2 Connection to Integral Polyhedra and TDI Systems -- 1.3 Examples -- 2 Density Lemma and the Theorem of the Alternative -- 3 p-Adic Generating Sets for Subspaces and Cones -- 4 Totally Dual p-adic Systems -- 5 p-Adic Polyhedra -- 6 T-joins and Perfect Matchings -- References -- Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing -- 1 Introduction -- 1.1 Problem Statement -- 1.2 Previous Work and Our Results -- 2 Distances Without Preprocessing in the Simple Model -- 3 Logarithmic Query Time in the Simple Model -- 4 The General Model -- 5 Practical Aspects -- 5.1 Implementation -- 5.2 Reservations and Discounts for Incremental Routing -- References -- On the Maximal Number of Columns of a -modular Matrix -- 1 Introduction -- 2 Counting by Residue Classes -- 2.1 Small Dimensions and Lower Bounds in the Shifted Setting -- 3 A Polynomial Upper Bound on h_s(m) -- 4 Feasibility of Sauer Matrices in Low Dimensions -- 5 Discussion and Open Problems -- References -- The Simultaneous Semi-random Model for TSP -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Technical Overview -- 1.3 Additional Related Work -- 2 Preliminaries -- 3 An Improved Approximation for Local Search in the Simultaneous Semi-random Model -- 3.1 An Improved Worst-Case Approximation for Local Search -- 3.2 Proof of Theorem 1 -- 4 Improved Approximations Require poly(n) Random Points -- 4.1 A Framework for Simultaneous Semi-random Lower Bounds -- 4.2 The Construction -- References -- A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem -- 1 Introduction -- 1.1 Our Results -- 1.2 Our Techniques -- 2 The Analysis of the LP-Based Algorithm.
2.1 Preliminaries -- 2.2 The Analysis of the Algorithm -- 3 Conclusion -- A Deferred Proofs -- References -- Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition -- 1 Introduction -- 1.1 Our Results -- 1.2 Technical Overview -- 1.3 Preliminaries -- 2 Structural Theorem -- 2.1 No Moderate-Sized Min-Cuts -- 2.2 Trim and Shave Operations -- 2.3 Proof of Theorem 2 -- References -- Improving the Cook et al. Proximity Bound Given Integral Valued Constraints -- 1 Introduction -- 1.1 Preliminaries and Notation -- 1.2 Dimension Reduction -- 2 Proximity for 1, 2, and 3-Dimensional Polyhedra -- 3 Lifting Proximity Results to Higher Dimensions -- 4 Proof of the Main Theorem -- 5 Proximity in the Strictly -Modular Case -- 6 A Lower Bound Example -- References -- Sparse Multi-term Disjunctive Cuts for the Epigraph of a Function of Binary Variables -- 1 Introduction -- 2 Sparse Multi-term 0-1 Disjunctive Cuts -- 2.1 Generating Multi-term 0-1 Disjunctive Cuts -- 2.2 I-Sparse Inequalities -- 2.3 Accelerating the Evaluation of IR() -- 3 Two Selection Rules for the Support I -- 3.1 A Greedy Rule Based on a Monotone Submodular Approximation -- 3.2 A Cutting-Plane Approximation Rule -- 4 Computational Results -- 5 Future Directions -- References -- A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time -- 1 Introduction -- 1.1 Related Work -- 2 Preliminaries: Tree Decompositions -- 3 The LP Relaxation and the Rounding Algorithm -- 3.1 The LP Relaxation -- 3.2 The Rounding Algorithm -- References -- Optimal Item Pricing in Online Combinatorial Auctions -- 1 Introduction -- 1.1 Context and Related Work -- 1.2 A Technical Highlight and Additional Results -- 2 Model -- 3 Random Valuations -- 4 Single-Minded Valuations -- 4.1 Matching in Graphs: d=2 -- 4.2 Hypergraph Matching: d> -- 2 -- References.
On Circuit Diameter Bounds via Circuit Imbalances -- 1 Introduction -- 1.1 Our Contributions -- 2 Preliminaries -- 3 The Circuit Diameter Bound -- 4 Diameter Bounds for the Capacitated Case -- 5 A Circuit-Augmentation Algorithm for Feasibility -- 6 A Circuit-Augmentation Algorithm for Optimization -- References -- A Simple Method for Convex Optimization in the Oracle Model -- 1 Introduction -- 2 Algorithm -- 3 Computational Experiments -- References -- On the Complexity of Separation from the Knapsack Polytope -- 1 Introduction -- 2 Extended Cover Inequality Separation -- 3 (1,k)-Configuration Inequality Separation -- 4 Weight Inequality Separation -- References -- Simple Odd -Cycle Inequalities for Binary Polynomial Optimization -- 1 Introduction -- 2 Building Block Inequalities -- 3 Simple Odd -Cycle Inequalities -- 4 Separation Algorithm -- 5 Relation to Non-simple Odd -Cycle Inequalities -- References -- Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems -- 1 Introduction -- 2 LP-Relaxation for the Prize-Collecting-Walks Problem -- 3 A Combinatorial Algorithm -- 4 Applications for Orienteering Problems -- 5 Applications for the k Minimum-Latency Problem -- 6 Computational Results for Orienteering -- References -- Intersecting and Dense Restrictions of Clutters in Polynomial Time -- 1 Introduction -- 2 The Unifying Theorem -- 3 k-Wise Intersecting Clutters -- 4 Dense Clutters -- 5 Finding Delta or Blocker of Extended Odd Hole Minors -- References -- LP-Based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization -- 1 Introduction -- 1.1 Our Contributions -- 2 A Polylogarithmic Approximation for PDB -- 3 From Disjoint Bilinear Optimization to Two-Stage Adjustable Robust Optimization -- 4 Numerical Experiments -- 5 Conclusion -- References.
A Constant-Factor Approximation for Generalized Malleable Scheduling Under M-Concave Processing Speeds -- 1 Introduction -- 1.1 Generalized Malleable Scheduling and Main Results -- 1.2 Submodularity, M-Concavity, and Matroids -- 1.3 Organization of the Paper -- 2 The Configuration LP -- 3 Overview of the Algorithm -- 4 Description and Analysis of the Intermediate Steps -- 4.1 Step 1: Single-machine Assignments for J1 -- 4.2 Step 2: Assignments with Low Total Speed for J2 -- 4.3 Step 3A: Splitting Assignments with High Total Speed -- 4.4 Step 3B: Constructing an Integer Assignment for J3 -- 5 Generalized Malleable Jobs and Fair Allocations -- 6 Conclusion -- References -- Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands -- 1 Introduction -- 1.1 Related Work -- 2 Preliminaries -- 3 A Combinatorial 3.25-Approximation -- 3.1 Analysis -- 4 An Improved LP-Based Approximation -- 4.1 Analysis -- References -- SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs -- 1 Introduction -- 2 Disjunctive Cut Methodology -- 2.1 Preliminaries -- 2.2 Deriving Disjunctive Cuts -- 2.3 Separation Procedure for Disjunctive Cuts -- 3 Solution Methods Using Disjunctive Cuts -- 3.1 A Branch-and-Cut Algorithm -- 3.2 An Integer Cutting Plane Algorithm -- 4 Computational Analysis -- 4.1 Instances -- 4.2 Computational Environment -- 4.3 Numerical Results -- 5 Conclusions -- References -- Non-adaptive Stochastic Score Classification and Explainable Halfspace Evaluation -- 1 Introduction -- 1.1 Results and Techniques -- 1.2 Related Work -- 2 Preliminaries -- 3 The Stochastic Score Classification Algorithm -- 3.1 The Algorithm -- 3.2 The Analysis -- 3.3 Proof of Lemma 3 -- 4 Computational Results -- References -- On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs -- 1 Introduction.
2 Preliminaries -- 2.1 Binary Programs and Branch-and-Bound Proofs -- 2.2 Boolean Formulas and the Exponential Time Hypothesis -- 3 Hardness of Approximation -- 4 (Non-)Automatizability of Branch-and-Bound -- 5 #P-Hardness of Exact Computation -- 6 Outlook -- References -- Matroid-Based TSP Rounding for Half-Integral Solutions -- 1 Introduction -- 2 Notation and Preliminaries -- 3 Samplers -- 3.1 Samplers for Even |V(H)| -- 3.2 Correlation Properties of Samplers -- 4 Sampling Algorithm for General Solutions -- 4.1 The Cut Hierarchy -- 5 Analysis Part I: The Even-at-Last Property -- 6 Analysis Part II: The O-Join and Charging -- References -- The Two-Stripe Symmetric Circulant TSP is in P -- 1 Introduction -- 2 Background and Notation -- 2.1 Circulant Graphs -- 2.2 Cylinder Graphs -- 2.3 Trivial Cases -- 2.4 Main Result -- 2.5 Previous Results on Two-Stripe TSP -- 3 GG Paths and a Reduction to Hamiltonian Paths on Cylinder Graphs -- 3.1 Reduction of 2-Stripe Problem to Cylinder Graph Problem -- 3.2 GG Paths -- 4 Proof of Main Result -- 5 The Algorithm -- 6 Proof Sketch of Theorem 3 -- 7 Conclusion -- References -- An Abstract Model for Branch-and-Cut -- 1 Introduction -- 2 Preliminaries -- 3 The Abstract Branch-and-Cut Model -- 4 Optimizing Tree Size -- 5 Optimizing Tree Time -- 5.1 Time-Functions Bounded by a Polynomial -- 5.2 Adding k Cuts Along Every Root-to-Leaf Path -- 5.3 Proof of Theorem 13 -- 6 Conclusion and Potential Extensions -- References -- Neural Networks with Linear Threshold Activations: Structure and Algorithms -- 1 Introduction -- 2 Representability Results -- 3 Proof of Proposition 1 -- 4 Globally Optimal Empirical Risk Minimization -- 4.1 Preliminaries -- 4.2 Proof of Theorem 2 -- 5 Open Questions -- References -- A PTAS for the Horizontal Rectangle Stabbing Problem -- 1 Introduction -- 1.1 Our Results -- 1.2 Further Related Work.
2 Dynamic Program.
Record Nr. UNISA-996475770403316
Cham, Switzerland : , : Springer, , [2022]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Integer programming and combinatorial optimization : 23rd international conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, proceedings / / edited by Karen Aardal and Laura Sanità
Integer programming and combinatorial optimization : 23rd international conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, proceedings / / edited by Karen Aardal and Laura Sanità
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2022]
Descrizione fisica 1 online resource (469 pages)
Disciplina 519.64
Collana Lecture Notes in Computer Science
Soggetto topico Combinatorial optimization
ISBN 3-031-06901-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Organization -- Contents -- Total Dual Dyadicness and Dyadic Generating Sets -- 1 Introduction -- 1.1 Totally Dual p-adic Systems and p-adic Generating Sets -- 1.2 Connection to Integral Polyhedra and TDI Systems -- 1.3 Examples -- 2 Density Lemma and the Theorem of the Alternative -- 3 p-Adic Generating Sets for Subspaces and Cones -- 4 Totally Dual p-adic Systems -- 5 p-Adic Polyhedra -- 6 T-joins and Perfect Matchings -- References -- Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing -- 1 Introduction -- 1.1 Problem Statement -- 1.2 Previous Work and Our Results -- 2 Distances Without Preprocessing in the Simple Model -- 3 Logarithmic Query Time in the Simple Model -- 4 The General Model -- 5 Practical Aspects -- 5.1 Implementation -- 5.2 Reservations and Discounts for Incremental Routing -- References -- On the Maximal Number of Columns of a -modular Matrix -- 1 Introduction -- 2 Counting by Residue Classes -- 2.1 Small Dimensions and Lower Bounds in the Shifted Setting -- 3 A Polynomial Upper Bound on h_s(m) -- 4 Feasibility of Sauer Matrices in Low Dimensions -- 5 Discussion and Open Problems -- References -- The Simultaneous Semi-random Model for TSP -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Technical Overview -- 1.3 Additional Related Work -- 2 Preliminaries -- 3 An Improved Approximation for Local Search in the Simultaneous Semi-random Model -- 3.1 An Improved Worst-Case Approximation for Local Search -- 3.2 Proof of Theorem 1 -- 4 Improved Approximations Require poly(n) Random Points -- 4.1 A Framework for Simultaneous Semi-random Lower Bounds -- 4.2 The Construction -- References -- A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem -- 1 Introduction -- 1.1 Our Results -- 1.2 Our Techniques -- 2 The Analysis of the LP-Based Algorithm.
2.1 Preliminaries -- 2.2 The Analysis of the Algorithm -- 3 Conclusion -- A Deferred Proofs -- References -- Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition -- 1 Introduction -- 1.1 Our Results -- 1.2 Technical Overview -- 1.3 Preliminaries -- 2 Structural Theorem -- 2.1 No Moderate-Sized Min-Cuts -- 2.2 Trim and Shave Operations -- 2.3 Proof of Theorem 2 -- References -- Improving the Cook et al. Proximity Bound Given Integral Valued Constraints -- 1 Introduction -- 1.1 Preliminaries and Notation -- 1.2 Dimension Reduction -- 2 Proximity for 1, 2, and 3-Dimensional Polyhedra -- 3 Lifting Proximity Results to Higher Dimensions -- 4 Proof of the Main Theorem -- 5 Proximity in the Strictly -Modular Case -- 6 A Lower Bound Example -- References -- Sparse Multi-term Disjunctive Cuts for the Epigraph of a Function of Binary Variables -- 1 Introduction -- 2 Sparse Multi-term 0-1 Disjunctive Cuts -- 2.1 Generating Multi-term 0-1 Disjunctive Cuts -- 2.2 I-Sparse Inequalities -- 2.3 Accelerating the Evaluation of IR() -- 3 Two Selection Rules for the Support I -- 3.1 A Greedy Rule Based on a Monotone Submodular Approximation -- 3.2 A Cutting-Plane Approximation Rule -- 4 Computational Results -- 5 Future Directions -- References -- A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time -- 1 Introduction -- 1.1 Related Work -- 2 Preliminaries: Tree Decompositions -- 3 The LP Relaxation and the Rounding Algorithm -- 3.1 The LP Relaxation -- 3.2 The Rounding Algorithm -- References -- Optimal Item Pricing in Online Combinatorial Auctions -- 1 Introduction -- 1.1 Context and Related Work -- 1.2 A Technical Highlight and Additional Results -- 2 Model -- 3 Random Valuations -- 4 Single-Minded Valuations -- 4.1 Matching in Graphs: d=2 -- 4.2 Hypergraph Matching: d> -- 2 -- References.
On Circuit Diameter Bounds via Circuit Imbalances -- 1 Introduction -- 1.1 Our Contributions -- 2 Preliminaries -- 3 The Circuit Diameter Bound -- 4 Diameter Bounds for the Capacitated Case -- 5 A Circuit-Augmentation Algorithm for Feasibility -- 6 A Circuit-Augmentation Algorithm for Optimization -- References -- A Simple Method for Convex Optimization in the Oracle Model -- 1 Introduction -- 2 Algorithm -- 3 Computational Experiments -- References -- On the Complexity of Separation from the Knapsack Polytope -- 1 Introduction -- 2 Extended Cover Inequality Separation -- 3 (1,k)-Configuration Inequality Separation -- 4 Weight Inequality Separation -- References -- Simple Odd -Cycle Inequalities for Binary Polynomial Optimization -- 1 Introduction -- 2 Building Block Inequalities -- 3 Simple Odd -Cycle Inequalities -- 4 Separation Algorithm -- 5 Relation to Non-simple Odd -Cycle Inequalities -- References -- Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems -- 1 Introduction -- 2 LP-Relaxation for the Prize-Collecting-Walks Problem -- 3 A Combinatorial Algorithm -- 4 Applications for Orienteering Problems -- 5 Applications for the k Minimum-Latency Problem -- 6 Computational Results for Orienteering -- References -- Intersecting and Dense Restrictions of Clutters in Polynomial Time -- 1 Introduction -- 2 The Unifying Theorem -- 3 k-Wise Intersecting Clutters -- 4 Dense Clutters -- 5 Finding Delta or Blocker of Extended Odd Hole Minors -- References -- LP-Based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization -- 1 Introduction -- 1.1 Our Contributions -- 2 A Polylogarithmic Approximation for PDB -- 3 From Disjoint Bilinear Optimization to Two-Stage Adjustable Robust Optimization -- 4 Numerical Experiments -- 5 Conclusion -- References.
A Constant-Factor Approximation for Generalized Malleable Scheduling Under M-Concave Processing Speeds -- 1 Introduction -- 1.1 Generalized Malleable Scheduling and Main Results -- 1.2 Submodularity, M-Concavity, and Matroids -- 1.3 Organization of the Paper -- 2 The Configuration LP -- 3 Overview of the Algorithm -- 4 Description and Analysis of the Intermediate Steps -- 4.1 Step 1: Single-machine Assignments for J1 -- 4.2 Step 2: Assignments with Low Total Speed for J2 -- 4.3 Step 3A: Splitting Assignments with High Total Speed -- 4.4 Step 3B: Constructing an Integer Assignment for J3 -- 5 Generalized Malleable Jobs and Fair Allocations -- 6 Conclusion -- References -- Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands -- 1 Introduction -- 1.1 Related Work -- 2 Preliminaries -- 3 A Combinatorial 3.25-Approximation -- 3.1 Analysis -- 4 An Improved LP-Based Approximation -- 4.1 Analysis -- References -- SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs -- 1 Introduction -- 2 Disjunctive Cut Methodology -- 2.1 Preliminaries -- 2.2 Deriving Disjunctive Cuts -- 2.3 Separation Procedure for Disjunctive Cuts -- 3 Solution Methods Using Disjunctive Cuts -- 3.1 A Branch-and-Cut Algorithm -- 3.2 An Integer Cutting Plane Algorithm -- 4 Computational Analysis -- 4.1 Instances -- 4.2 Computational Environment -- 4.3 Numerical Results -- 5 Conclusions -- References -- Non-adaptive Stochastic Score Classification and Explainable Halfspace Evaluation -- 1 Introduction -- 1.1 Results and Techniques -- 1.2 Related Work -- 2 Preliminaries -- 3 The Stochastic Score Classification Algorithm -- 3.1 The Algorithm -- 3.2 The Analysis -- 3.3 Proof of Lemma 3 -- 4 Computational Results -- References -- On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs -- 1 Introduction.
2 Preliminaries -- 2.1 Binary Programs and Branch-and-Bound Proofs -- 2.2 Boolean Formulas and the Exponential Time Hypothesis -- 3 Hardness of Approximation -- 4 (Non-)Automatizability of Branch-and-Bound -- 5 #P-Hardness of Exact Computation -- 6 Outlook -- References -- Matroid-Based TSP Rounding for Half-Integral Solutions -- 1 Introduction -- 2 Notation and Preliminaries -- 3 Samplers -- 3.1 Samplers for Even |V(H)| -- 3.2 Correlation Properties of Samplers -- 4 Sampling Algorithm for General Solutions -- 4.1 The Cut Hierarchy -- 5 Analysis Part I: The Even-at-Last Property -- 6 Analysis Part II: The O-Join and Charging -- References -- The Two-Stripe Symmetric Circulant TSP is in P -- 1 Introduction -- 2 Background and Notation -- 2.1 Circulant Graphs -- 2.2 Cylinder Graphs -- 2.3 Trivial Cases -- 2.4 Main Result -- 2.5 Previous Results on Two-Stripe TSP -- 3 GG Paths and a Reduction to Hamiltonian Paths on Cylinder Graphs -- 3.1 Reduction of 2-Stripe Problem to Cylinder Graph Problem -- 3.2 GG Paths -- 4 Proof of Main Result -- 5 The Algorithm -- 6 Proof Sketch of Theorem 3 -- 7 Conclusion -- References -- An Abstract Model for Branch-and-Cut -- 1 Introduction -- 2 Preliminaries -- 3 The Abstract Branch-and-Cut Model -- 4 Optimizing Tree Size -- 5 Optimizing Tree Time -- 5.1 Time-Functions Bounded by a Polynomial -- 5.2 Adding k Cuts Along Every Root-to-Leaf Path -- 5.3 Proof of Theorem 13 -- 6 Conclusion and Potential Extensions -- References -- Neural Networks with Linear Threshold Activations: Structure and Algorithms -- 1 Introduction -- 2 Representability Results -- 3 Proof of Proposition 1 -- 4 Globally Optimal Empirical Risk Minimization -- 4.1 Preliminaries -- 4.2 Proof of Theorem 2 -- 5 Open Questions -- References -- A PTAS for the Horizontal Rectangle Stabbing Problem -- 1 Introduction -- 1.1 Our Results -- 1.2 Further Related Work.
2 Dynamic Program.
Record Nr. UNINA-9910574063603321
Cham, Switzerland : , : Springer, , [2022]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010, Proceedings / / edited by Andrea Lodi, Michela Milano, Paolo Toth
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010, Proceedings / / edited by Andrea Lodi, Michela Milano, Paolo Toth
Edizione [1st ed. 2010.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Descrizione fisica 1 online resource (XI, 369 p. 70 illus.)
Disciplina 519.64
Collana Theoretical Computer Science and General Issues
Soggetto topico Artificial intelligence
Discrete mathematics
Computer science
Numerical analysis
Computer science—Mathematics
Algorithms
Artificial Intelligence
Discrete Mathematics
Theory of Computation
Numerical Analysis
Discrete Mathematics in Computer Science
ISBN 1-280-38701-7
9786613564931
3-642-13520-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Towards a MIP-Cut Metascheme -- Challenges for CPAIOR in Computational Sustainability -- Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving -- On Matrices, Automata, and Double Counting -- The Increasing Nvalue Constraint -- Improving the Held and Karp Approach with Constraint Programming -- Characterization and Automation of Matching-Based Neighborhoods -- Rapid Learning for Binary Programs -- Hybrid Methods for the Multileaf Collimator Sequencing Problem -- Automatically Exploiting Subproblem Equivalence in Constraint Programming -- Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition -- Integrated Maintenance Scheduling for Semiconductor Manufacturing -- A Constraint Programming Approach for the Service Consolidation Problem -- Solving Connected Subgraph Problems in Wildlife Conservation -- Consistency Check for the Bin Packing Constraint Revisited -- A Relax-and-Cut Framework for Gomory’s Mixed-Integer Cuts -- An In-Out Approach to Disjunctive Optimization -- A SAT Encoding for Multi-dimensional Packing Problems -- Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach -- On the Design of the Next Generation Access Networks -- Vehicle Routing for Food Rescue Programs: A Comparison of Different Approaches -- Constraint Programming and Combinatorial Optimisation in Numberjack -- Automated Configuration of Mixed Integer Programming Solvers -- Upper Bounds on the Number of Solutions of Binary Integer Programs -- Matrix Interdiction Problem -- Strong Combination of Ant Colony Optimization with Constraint Programming Optimization -- Service-Oriented Volunteer Computing for Massively Parallel Constraint Solving Using Portfolios -- Constraint Programming with Arbitrarily Large Integer Variables -- Constraint-Based Local Search for Constrained Optimum Paths Problems -- Stochastic Constraint Programming by Neuroevolution with Filtering -- The Weighted Spanning Tree Constraint Revisited -- Constraint Reasoning with Uncertain Data Using CDF-Intervals -- Revisiting the Soft Global Cardinality Constraint -- A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling -- Strategic Planning for Disaster Recovery with Stochastic Last Mile Distribution -- Massively Parallel Constraint Programming for Supercomputers: Challenges and Initial Results -- Boosting Set Constraint Propagation for Network Design -- More Robust Counting-Based Search Heuristics with Alldifferent Constraints.
Record Nr. UNISA-996465610403316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui