Pages that link to "Item:Q4074671"
From MaRDI portal
The following pages link to Faces for a linear inequality in 0–1 variables (Q4074671):
Displaying 50 items.
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Strong valid inequalities for Boolean logical pattern generation (Q1675646) (← links)
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem (Q1683679) (← links)
- Supermodular covering knapsack polytope (Q1751131) (← links)
- Strong bounds with cut and column generation for class-teacher timetabling (Q1761917) (← links)
- A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
- Requiring connectivity in the set covering problem (Q1774524) (← links)
- Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← links)
- Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
- Efficient reformulation for 0-1 programs -- methods and computational results (Q1803672) (← links)
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. (Q1811629) (← links)
- Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds (Q1824557) (← links)
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (Q1904710) (← links)
- Ordered matroids and regular independence systems (Q1918556) (← links)
- Strong IP formulations need large coefficients (Q2019425) (← links)
- Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem (Q2027061) (← links)
- Precedence-constrained covering problems with multiplicity constraints (Q2085754) (← links)
- The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
- Online joint bid/daily budget optimization of Internet advertising campaigns (Q2124437) (← links)
- On the complexity of separation from the knapsack polytope (Q2164691) (← links)
- Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
- Multidimensional sum-up rounding for integer programming in optimal experimental design (Q2220654) (← links)
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets (Q2248758) (← links)
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints (Q2276891) (← links)
- On lifted cover inequalities: a new lifting procedure with unusual properties (Q2294273) (← links)
- New valid inequalities for the fixed-charge and single-node flow polytopes (Q2294335) (← links)
- Idealness and 2-resistant sets (Q2294336) (← links)
- Parametric convex quadratic relaxation of the quadratic knapsack problem (Q2329476) (← links)
- A polyhedral study of the semi-continuous knapsack problem (Q2434996) (← links)
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
- Polyhedral properties for the intersection of two knapsacks (Q2476986) (← links)
- Formulations and valid inequalities for the heterogeneous vehicle routing problem (Q2490341) (← links)
- A note on the continuous mixing set (Q2517804) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints (Q2639772) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- The transit time constrained fixed charge multi-commodity network design problem (Q2669603) (← links)
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)
- A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem (Q2892146) (← links)
- LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
- Valid inequalities, cutting planes and integrality of the knapsack polytope (Q3101539) (← links)
- Some integer programs arising in the design of main frame computers (Q3135915) (← links)
- Approximate Deadline-Scheduling with Precedence Constraints (Q3452812) (← links)
- A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem (Q3452846) (← links)
- Generalized cover facet inequalities for the generalized assignment problem (Q3553764) (← links)
- Lifting the facets of zero–one polytopes (Q3865839) (← links)
- (1,k)-configurations and facets for packing problems (Q3869083) (← links)
