Canonical Cuts on the Unit Hypercube
From MaRDI portal
Publication:5647555
DOI10.1137/0123007zbMATH Open0237.52004OpenAlexW2049741107MaRDI QIDQ5647555FDOQ5647555
Publication date: 1972
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0123007
Polytopes and polyhedra (52Bxx) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Cited In (74)
- An alternative efficient representation for the project portfolio selection problem
- Minimum cost delivery of multi-item orders in e-commerce logistics
- Solving the traveling salesman problem with interdiction and fortification
- Implicit cover inequalities
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
- The Weighted Set Covering Game: A Vaccine Pricing Model for Pediatric Immunization
- Sphere coverings of the hypercube with incomparable centers
- Representations of Boolean functions by systems of linear inequalities
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- A characterization of knapsacks with the max-flow--min-cut property
- On defining sets of vertices of the hypercube by linear inequalities
- Zero-one programming with many variables and few constraints
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
- Reliability, covering and balanced matrices
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- Integer programming formulation of combinatorial optimization problems
- Polytopes associated with symmetry handling
- A storm of feasibility pumps for nonconvex MINLP
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
- New formulations and solution approaches for the latency location routing problem
- Finding multiple optimal solutions of signomial discrete programming problems with free variables
- Bilevel Knapsack with Interdiction Constraints
- Petroleum supply planning: reformulations and a novel decomposition algorithm
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
- A note on characterizing canonical cuts using geometry
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter
- Almost integral polyhedra related to certain combinatorial optimization problems
- Natural gas production network infrastructure development under uncertainty
- Sequence independent lifting for mixed knapsack problems with GUB constraints
- HMS: a hybrid multi-start algorithm for solving binary linear programs
- On interval-subgradient and no-good cuts
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- Alternative solution algorithm for winner determination problem with quantity discount of transportation service procurement
- Location-allocation models for traffic police patrol vehicles on an interurban network
- Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
- On the 2-Club Polytope of Graphs
- A direct dual method for the mixed plant location problem with some side constraints
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- A review of deterministic optimization methods in engineering and management
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
- Integer programming and convex analysis: Intersection cuts from outer polars
- Optimizing single-terminal dispatch of large volume trips to trucks
- Decomposition strategy for the stochastic pooling problem
- The precedence constrained knapsack problem: separating maximally violated inequalities
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
- Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization
- New convergent heuristics for 0-1 mixed integer programming
- Finding multiple solutions to general integer linear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Rounding-based heuristics for nonconvex MINLPS
- Enriching Solutions to Combinatorial Problems via Solution Engineering
- Packing, partitioning, and covering symresacks
- Polynomial size IP formulations of knapsack may require exponentially large coefficients
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound
- Improving the performance of DICOPT in convex MINLP problems using a feasibility pump
- Lifting the facets of zero–one polytopes
- Water distribution networks design under uncertainty
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- Spherical cuts for integer programming problems
- Template-Based Minor Embedding for Adiabatic Quantum Optimization
- Logic-based Benders decomposition for wildfire suppression
- Combining optimisation and simulation using logic-based Benders decomposition
- The convex hull of a linear congruence relation in zero-one variables
- Multi-period distribution networks with purchase commitment contracts
- Finding all global optima of engineering design problems with discrete signomial terms
- Identifying the most important set of weights when modelling bad outputs with the weak disposability approach
- Fairness over time in dynamic resource allocation with an application in healthcare
This page was built for publication: Canonical Cuts on the Unit Hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5647555)
