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.
Integer Programming and Combinatorial Optimization [[electronic resource] ] : 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021, Proceedings / / edited by Mohit Singh, David P. Williamson
| Integer Programming and Combinatorial Optimization [[electronic resource] ] : 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021, Proceedings / / edited by Mohit Singh, David P. Williamson |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (XI, 490 p. 51 illus., 34 illus. in color.) |
| Disciplina | 519.77 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Computer networks Algorithms Data structures (Computer science) Information theory Software engineering Mathematics of Computing Computer Communication Networks Design and Analysis of Algorithms Data Structures and Information Theory Software Engineering |
| ISBN | 3-030-73879-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Improving the Approximation Ratio for Capacitated Vehicle Routing -- Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual -- Approximating the discrete time-cost tradeoff problem with bounded depth -- Sum-of-squares hierarchies for binary polynomial optimization -- Complexity, Exactness, and Rationality in Polynomial Optimization -- On the Geometry of Symmetry Breaking Inequalities -- Affinely representable lattices, stable matchings, and choice functions -- A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows -- A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with $2 \times 2$ submatrices -- On the implementation and strengthening of intersection cuts for QCQPs -- Lifting Convex Inequalities for Bipartite Bilinear Programs -- A Computational Status Update for Exact Rational Mixed Integer Programming -- New Exact Techniques Applied to a Class of Network Flow Formulations -- Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets -- Semi-Streaming Algorithms for Submodular Matroid Intersection -- Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems -- On the recognition of {a,b,c}-modular matrices -- On the Power of Static Assignment Policies for Robust Facility Location Problems -- Robust k-Center with Two Types of Radii -- Speed-Robust Scheduling - Rocks, Bricks, and Sand -- The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs -- Fast Quantum Subroutines for the Simplex Method -- Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators -- A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem -- Fixed Parameter Approximation Scheme for Min-max k-cut -- Computational Aspects of Relaxation Complexity -- Complexity of branch-and-bound and cutting planes in mixed-integer optimization – II -- Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs -- Proximity bounds for random integer programs -- On the Integrality Gap of Binary Integer Programs with Gaussian Data -- Linear Regression with Mismatched Data: a Provably Optimal Local Search Algorithm -- A New Integer Programming Formulation of the Graphical Traveling Salesman Problem -- Implications, conflicts, and reductions for Steiner trees. |
| Record Nr. | UNISA-996464449003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Integer Programming and Combinatorial Optimization : 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021, Proceedings / / edited by Mohit Singh, David P. Williamson
| Integer Programming and Combinatorial Optimization : 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021, Proceedings / / edited by Mohit Singh, David P. Williamson |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (XI, 490 p. 51 illus., 34 illus. in color.) |
| Disciplina | 519.77 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Computer networks Algorithms Data structures (Computer science) Information theory Software engineering Mathematics of Computing Computer Communication Networks Design and Analysis of Algorithms Data Structures and Information Theory Software Engineering |
| ISBN | 3-030-73879-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Improving the Approximation Ratio for Capacitated Vehicle Routing -- Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual -- Approximating the discrete time-cost tradeoff problem with bounded depth -- Sum-of-squares hierarchies for binary polynomial optimization -- Complexity, Exactness, and Rationality in Polynomial Optimization -- On the Geometry of Symmetry Breaking Inequalities -- Affinely representable lattices, stable matchings, and choice functions -- A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows -- A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with $2 \times 2$ submatrices -- On the implementation and strengthening of intersection cuts for QCQPs -- Lifting Convex Inequalities for Bipartite Bilinear Programs -- A Computational Status Update for Exact Rational Mixed Integer Programming -- New Exact Techniques Applied to a Class of Network Flow Formulations -- Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets -- Semi-Streaming Algorithms for Submodular Matroid Intersection -- Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems -- On the recognition of {a,b,c}-modular matrices -- On the Power of Static Assignment Policies for Robust Facility Location Problems -- Robust k-Center with Two Types of Radii -- Speed-Robust Scheduling - Rocks, Bricks, and Sand -- The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs -- Fast Quantum Subroutines for the Simplex Method -- Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators -- A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem -- Fixed Parameter Approximation Scheme for Min-max k-cut -- Computational Aspects of Relaxation Complexity -- Complexity of branch-and-bound and cutting planes in mixed-integer optimization – II -- Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs -- Proximity bounds for random integer programs -- On the Integrality Gap of Binary Integer Programs with Gaussian Data -- Linear Regression with Mismatched Data: a Provably Optimal Local Search Algorithm -- A New Integer Programming Formulation of the Graphical Traveling Salesman Problem -- Implications, conflicts, and reductions for Steiner trees. |
| Record Nr. | UNINA-9910484432803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Integer Programming and Combinatorial Optimization [[electronic resource] ] : 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings / / edited by Matteo Fischetti, David P. Williamson
| Integer Programming and Combinatorial Optimization [[electronic resource] ] : 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings / / edited by Matteo Fischetti, David P. Williamson |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (508 p.) |
| Disciplina | 519.77 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Probabilities Computer science—Mathematics Discrete mathematics Numerical analysis Algorithms Theory of Computation Software Engineering Probability Theory Discrete Mathematics in Computer Science Numerical Analysis |
| ISBN |
1-280-94938-4
9786610949380 3-540-72792-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 1 -- Inequalities from Two Rows of a Simplex Tableau -- Cuts for Conic Mixed-Integer Programming -- Sequential-Merge Facets for Two-Dimensional Group Problems -- Session 2 -- Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract) -- The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization -- Finding a Polytope from Its Graph in Polynomial Time -- Session 3 -- Orbitopal Fixing -- New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing -- Orbital Branching -- Session 4 -- Distinct Triangle Areas in a Planar Point Set -- Scheduling with Precedence Constraints of Low Fractional Dimension -- Approximation Algorithms for 2-Stage Stochastic Scheduling Problems -- Session 5 -- On Integer Programming and the Branch-Width of the Constraint Matrix -- Matching Problems in Polymatroids Without Double Circuits -- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) -- Session 6 -- On a Generalization of the Master Cyclic Group Polyhedron -- A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications -- On the Exact Separation of Mixed Integer Knapsack Cuts -- Session 7 -- A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization -- On Convex Minimization over Base Polytopes -- Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems -- Session 8 -- Generating Multiple Solutions for Mixed Integer Programming Problems -- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations -- DINS, a MIP Improvement Heuristic -- Session 9 -- Mixed-Integer Vertex Covers on Bipartite Graphs -- On the MIR Closure of Polyhedra -- The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows -- Session 10 -- Simple Explicit Formula for Counting Lattice Points of Polyhedra -- Characterizations of Total Dual Integrality -- Sign-Solvable Linear Complementarity Problems -- Session 11 -- An Integer Programming Approach for Linear Programs with Probabilistic Constraints -- Infrastructure Leasing Problems -- Robust Combinatorial Optimization with Exponential Scenarios -- Session 12 -- Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities -- Optimal Efficiency Guarantees for Network Design Mechanisms -- The Set Connector Problem in Graphs. |
| Record Nr. | UNISA-996466262503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings / / edited by Matteo Fischetti, David P. Williamson
| Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings / / edited by Matteo Fischetti, David P. Williamson |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (508 p.) |
| Disciplina | 519.77 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Probabilities Computer science—Mathematics Discrete mathematics Numerical analysis Algorithms Theory of Computation Software Engineering Probability Theory Discrete Mathematics in Computer Science Numerical Analysis |
| ISBN |
1-280-94938-4
9786610949380 3-540-72792-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 1 -- Inequalities from Two Rows of a Simplex Tableau -- Cuts for Conic Mixed-Integer Programming -- Sequential-Merge Facets for Two-Dimensional Group Problems -- Session 2 -- Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract) -- The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization -- Finding a Polytope from Its Graph in Polynomial Time -- Session 3 -- Orbitopal Fixing -- New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing -- Orbital Branching -- Session 4 -- Distinct Triangle Areas in a Planar Point Set -- Scheduling with Precedence Constraints of Low Fractional Dimension -- Approximation Algorithms for 2-Stage Stochastic Scheduling Problems -- Session 5 -- On Integer Programming and the Branch-Width of the Constraint Matrix -- Matching Problems in Polymatroids Without Double Circuits -- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) -- Session 6 -- On a Generalization of the Master Cyclic Group Polyhedron -- A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications -- On the Exact Separation of Mixed Integer Knapsack Cuts -- Session 7 -- A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization -- On Convex Minimization over Base Polytopes -- Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems -- Session 8 -- Generating Multiple Solutions for Mixed Integer Programming Problems -- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations -- DINS, a MIP Improvement Heuristic -- Session 9 -- Mixed-Integer Vertex Covers on Bipartite Graphs -- On the MIR Closure of Polyhedra -- The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows -- Session 10 -- Simple Explicit Formula for Counting Lattice Points of Polyhedra -- Characterizations of Total Dual Integrality -- Sign-Solvable Linear Complementarity Problems -- Session 11 -- An Integer Programming Approach for Linear Programs with Probabilistic Constraints -- Infrastructure Leasing Problems -- Robust Combinatorial Optimization with Exponential Scenarios -- Session 12 -- Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities -- Optimal Efficiency Guarantees for Network Design Mechanisms -- The Set Connector Problem in Graphs. |
| Record Nr. | UNINA-9910768194503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||