Pages that link to "Item:Q5647555"
From MaRDI portal
The following pages link to Canonical Cuts on the Unit Hypercube (Q5647555):
Displayed 50 items.
- Implicit cover inequalities (Q266036) (← links)
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks (Q323507) (← links)
- Location-allocation models for traffic police patrol vehicles on an interurban network (Q478026) (← links)
- The precedence constrained knapsack problem: separating maximally violated inequalities (Q494425) (← links)
- Water distribution networks design under uncertainty (Q526639) (← links)
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
- On interval-subgradient and no-good cuts (Q613320) (← links)
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs (Q662860) (← links)
- Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope (Q761350) (← links)
- Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (Q933795) (← links)
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter (Q958548) (← links)
- A characterization of knapsacks with the max-flow--min-cut property (Q1197887) (← links)
- On defining sets of vertices of the hypercube by linear inequalities (Q1214165) (← links)
- Integer programming formulation of combinatorial optimization problems (Q1239086) (← links)
- Almost integral polyhedra related to certain combinatorial optimization problems (Q1240148) (← links)
- Zero-one programming with many variables and few constraints (Q1247918) (← links)
- Optimizing single-terminal dispatch of large volume trips to trucks (Q1339147) (← links)
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts (Q1634801) (← links)
- Solving the traveling salesman problem with interdiction and fortification (Q1728213) (← links)
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
- Rounding-based heuristics for nonconvex MINLPS (Q1762458) (← links)
- HMS: a hybrid multi-start algorithm for solving binary linear programs (Q1791895) (← links)
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. (Q1811629) (← links)
- Sphere coverings of the hypercube with incomparable centers (Q1813996) (← links)
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
- Reliability, covering and balanced matrices (Q1892656) (← links)
- A storm of feasibility pumps for nonconvex MINLP (Q1925794) (← links)
- Decomposition strategy for the stochastic pooling problem (Q1928271) (← links)
- A review of deterministic optimization methods in engineering and management (Q1955154) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound (Q2129196) (← links)
- New formulations and solution approaches for the latency location routing problem (Q2147033) (← links)
- Alternative solution algorithm for winner determination problem with quantity discount of transportation service procurement (Q2164069) (← links)
- Packing, partitioning, and covering symresacks (Q2192122) (← links)
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (Q2220913) (← links)
- An alternative efficient representation for the project portfolio selection problem (Q2329483) (← links)
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem (Q2329707) (← links)
- Natural gas production network infrastructure development under uncertainty (Q2358131) (← links)
- Petroleum supply planning: reformulations and a novel decomposition algorithm (Q2358145) (← links)
- New convergent heuristics for 0-1 mixed integer programming (Q2378374) (← links)
- Finding multiple solutions to general integer linear programs (Q2384650) (← links)
- Polytopes associated with symmetry handling (Q2414904) (← links)
- Finding multiple optimal solutions of signomial discrete programming problems with free variables (Q2443364) (← links)
- Polynomial size IP formulations of knapsack may require exponentially large coefficients (Q2661530) (← links)
- Minimum cost delivery of multi-item orders in e-commerce logistics (Q2669718) (← links)
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation (Q2689829) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- The Weighted Set Covering Game: A Vaccine Pricing Model for Pediatric Immunization (Q2967623) (← links)