Canonical Cuts on the Unit Hypercube
From MaRDI portal
Cited in
(78)- A characterization of knapsacks with the max-flow--min-cut property
- On defining sets of vertices of the hypercube by linear inequalities
- Integer programming formulation of combinatorial optimization problems
- Almost integral polyhedra related to certain combinatorial optimization problems
- Zero-one programming with many variables and few constraints
- Optimizing single-terminal dispatch of large volume trips to trucks
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- Solving the traveling salesman problem with interdiction and fortification
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
- Rounding-based heuristics for nonconvex MINLPS
- HMS: a hybrid multi-start algorithm for solving binary linear programs
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
- Sphere coverings of the hypercube with incomparable centers
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
- Reliability, covering and balanced matrices
- A storm of feasibility pumps for nonconvex MINLP
- Decomposition strategy for the stochastic pooling problem
- A review of deterministic optimization methods in engineering and management
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound
- New formulations and solution approaches for the latency location routing problem
- Alternative solution algorithm for winner determination problem with quantity discount of transportation service procurement
- Packing, partitioning, and covering symresacks
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- An alternative efficient representation for the project portfolio selection problem
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem
- Natural gas production network infrastructure development under uncertainty
- Petroleum supply planning: reformulations and a novel decomposition algorithm
- New convergent heuristics for 0-1 mixed integer programming
- Finding multiple solutions to general integer linear programs
- Polytopes associated with symmetry handling
- Finding multiple optimal solutions of signomial discrete programming problems with free variables
- Implicit cover inequalities
- Polynomial size IP formulations of knapsack may require exponentially large coefficients
- Minimum cost delivery of multi-item orders in e-commerce logistics
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
- On the 2-club polytope of graphs
- The weighted set covering game: a vaccine pricing model for pediatric immunization
- Bilevel knapsack with interdiction constraints
- A direct dual method for the mixed plant location problem with some side constraints
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
- Spherical cuts for integer programming problems
- Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization
- Representations of Boolean functions by systems of linear inequalities
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Lifting the facets of zero–one polytopes
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- The convex hull of a linear congruence relation in zero-one variables
- Location-allocation models for traffic police patrol vehicles on an interurban network
- The precedence constrained knapsack problem: separating maximally violated inequalities
- Improving the performance of DICOPT in convex MINLP problems using a feasibility pump
- Finding all global optima of engineering design problems with discrete signomial terms
- Template-Based Minor Embedding for Adiabatic Quantum Optimization
- Enriching Solutions to Combinatorial Problems via Solution Engineering
- Water distribution networks design under uncertainty
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- A note on characterizing canonical cuts using geometry
- Integer programming and convex analysis: Intersection cuts from outer polars
- Logic-based Benders decomposition for wildfire suppression
- Combining optimisation and simulation using logic-based Benders decomposition
- Multi-period distribution networks with purchase commitment contracts
- 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
- On interval-subgradient and no-good cuts
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- Pareto front for two-stage distributionally robust optimization problems
- Exploring the minimum cost conflict mediation path to a desired resolution within the inverse graph model framework
- Bilinear branch and check for unspecified parallel machine scheduling with shift consideration
- A relax-fix-and-exclude algorithm for an MINLP problem with multilinear interpolations
- Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope
- Sequence independent lifting for mixed knapsack problems with GUB constraints
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter
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)
