The following pages link to Facet of regular 0–1 polytopes (Q4074672):
Displaying 46 items.
- Requiring connectivity in the set covering problem (Q1774524) (← 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)
- On Latin squares and the facial structure of related polytopes (Q1820162) (← links)
- Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (Q1904710) (← links)
- Time-tables, polyhedra and the greedy algorithm (Q1917272) (← links)
- Ordered matroids and regular independence systems (Q1918556) (← links)
- A new extended formulation of the generalized assignment problem and some associated valid inequalities (Q2009013) (← links)
- Multi-cover inequalities for totally-ordered multiple knapsack sets (Q2061876) (← links)
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← 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)
- On \(f\)-domination: polyhedral and algorithmic results (Q2274147) (← links)
- A polyhedral study of dynamic monopolies (Q2288851) (← links)
- Idealness and 2-resistant sets (Q2294336) (← links)
- Parametric convex quadratic relaxation of the quadratic knapsack problem (Q2329476) (← links)
- Polytopes associated with symmetry handling (Q2414904) (← links)
- A polyhedral study of the semi-continuous knapsack problem (Q2434996) (← 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)
- Approximation algorithms for covering/packing integer programs (Q2575835) (← links)
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints (Q2639772) (← links)
- The transit time constrained fixed charge multi-commodity network design problem (Q2669603) (← links)
- A note on the implications of approximate submodularity in discrete optimization (Q2678995) (← links)
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation (Q2689829) (← links)
- Optimum Solution of the Closest String Problem via Rank Distance (Q2835685) (← links)
- Polyhedral approaches to learning Bayesian networks (Q2979652) (← 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)
- Integer programming solution approach for inventory‐production–distribution problems with direct shipments (Q3499436) (← links)
- Lifting the facets of zero–one polytopes (Q3865839) (← links)
- (1,k)-configurations and facets for packing problems (Q3869083) (← links)
- Computing low-capacity 0–1 knapsack polytopes (Q3958269) (← links)
- Faces for a linear inequality in 0–1 variables (Q4074671) (← links)
- Lineare Charakterisierungen von Travelling Salesman Problemen (Q4119037) (← links)
- Small extended formulation for knapsack cover inequalities from monotone circuits (Q4612478) (← links)
- Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
- Regular (2, 2)-systems (Q4740583) (← links)
- Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
