Pages that link to "Item:Q4071008"
From MaRDI portal
The following pages link to Technical Note—A Note on Zero-One Programming (Q4071008):
Displaying 50 items.
- Lifting for conic mixed-integer programming (Q623366) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing (Q750288) (← links)
- Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope (Q761350) (← links)
- A note on node packing polytopes on hypergraphs (Q790042) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Airline crew scheduling: state-of-the-art (Q817210) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
- Solving the asymmetric traveling purchaser problem (Q867540) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
- Facet defining inequalities for the dichotomous knapsack problem (Q911989) (← links)
- (1,k)-configuration facets for the generalized assignment problem (Q914550) (← links)
- Solving a school bus scheduling problem with integer programming (Q954937) (← links)
- Facets of the knapsack polytope derived from disjoint and overlapping index configurations (Q1103523) (← links)
- On ternary problems (Q1121787) (← links)
- A generalization of antiwebs to independence systems and their canonical facets (Q1122478) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- A note on the knapsack problem with special ordered sets (Q1168894) (← links)
- On tightening cover induced inequalities (Q1199516) (← links)
- The complexity of lifted inequalities for the knapsack problem (Q1201098) (← links)
- Polyhedral results for the precedence-constrained knapsack problem (Q1208480) (← links)
- A class of facet producing graphs for vertex packing polyhedra (Q1220520) (← links)
- Bidirected and unidirected capacity installation in telecommunication networks. (Q1417563) (← links)
- A concurrent processing framework for the set partitioning problem (Q1603333) (← links)
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (Q1651623) (← links)
- Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience (Q1725611) (← 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 using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs (Q1814812) (← links)
- On the facets of the simple plant location packing polytope (Q1850113) (← links)
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (Q1904710) (← links)
- A note on the generalized Steiner tree polytope (Q1962028) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← links)
- On the complexity of separation from the knapsack polytope (Q2164691) (← links)
- Valid inequalities for mixed-integer programmes with fixed charges on sets of variables (Q2183195) (← links)
- Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
- On lifted cover inequalities: a new lifting procedure with unusual properties (Q2294273) (← links)
- Path planning for unmanned vehicles with localization constraints (Q2311193) (← links)
- A new lifting theorem for vertex packing (Q2329651) (← links)
- The project scheduling polyhedron: Dimension, facets and lifting theorems (Q2367366) (← links)
- Lexicographical order in integer programming (Q2405486) (← links)
- A branch-and-cut algorithm for the median-path problem (Q2490367) (← links)
- New facets for the two-stage uncapacitated facility location polytope (Q2655408) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation (Q2689829) (← links)
