Pages that link to "Item:Q1076609"
From MaRDI portal
The following pages link to Valid inequalities for mixed 0-1 programs (Q1076609):
Displaying 45 items.
- Lifted Euclidean inequalities for the integer single node flow set with upper bounds (Q322621) (← links)
- A deterministic method for the unit commitment problem in power systems (Q342197) (← links)
- A polyhedral study of lot-sizing with supplier selection (Q448963) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
- A multi-stop routing problem (Q940857) (← links)
- Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
- Submodularity and valid inequalities in capacitated fixed charge networks (Q1121763) (← links)
- Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
- Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
- The complementary class of generalized flow cover inequalities (Q1364783) (← links)
- An exact algorithm for the identical parallel machine scheduling problem. (Q1416605) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- The green capacitated multi-item lot sizing problem with parallel machines (Q1651651) (← links)
- Valid inequalities for separable concave constraints with indicator variables (Q1801013) (← links)
- Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds (Q1824557) (← links)
- A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208) (← links)
- The application of valid inequalities to the multi-stage lot-sizing problem (Q1894735) (← links)
- Valid inequalities and separation for capacitated fixed charge flow problems (Q1962074) (← links)
- Convex hull results for generalizations of the constant capacity single node flow set (Q2020609) (← links)
- Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization (Q2046309) (← links)
- Valid inequalities for mixed-integer programmes with fixed charges on sets of variables (Q2183195) (← links)
- Relating single-scenario facets to the convex hull of the extensive form of a stochastic single-node flow polytope (Q2183218) (← links)
- New valid inequalities for the fixed-charge and single-node flow polytopes (Q2294335) (← links)
- On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← links)
- Lifting for mixed integer programs with variable upper bounds (Q2345614) (← links)
- The multi-item capacitated lot-sizing problem with setup times and shortage costs (Q2464221) (← links)
- Polyhedral description of the integer single node flow set with constant bounds (Q2583130) (← links)
- Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140) (← links)
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints (Q2639772) (← links)
- LS-LIB: A Library of Tools for Solving Production Planning Problems (Q2971615) (← links)
- On cut-based inequalities for capacitated network design polyhedra (Q3082603) (← links)
- Valid Inequalities for Separable Concave Constraints with Indicator Variables (Q3186509) (← links)
- Linear complementarity problems solvable by integer programming (Q3798493) (← links)
- (Q5091246) (← links)
- Sequence independent lifting of cover inequalities (Q5101436) (← links)
- Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling (Q5129179) (← links)
- Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem (Q5355207) (← links)
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488) (← links)
- Flow pack facets of the single node fixed-charge flow polytope (Q5952067) (← links)
- Supermodularity and valid inequalities for quadratic optimization with indicators (Q6165587) (← links)
