The following pages link to Facets of the knapsack polytope (Q4077731):
Displaying 50 items.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- Implicit cover inequalities (Q266036) (← links)
- On the mixing set with a knapsack constraint (Q291057) (← links)
- An approach to the asymmetric multi-depot capacitated arc routing problem (Q319291) (← links)
- An exact algorithm for the reliability redundancy allocation problem (Q319293) (← links)
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
- Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing (Q439361) (← links)
- Branch-and-cut for complementarity-constrained optimization (Q482112) (← links)
- Compressor scheduling in oil fields. Piecewise-linear formulation, valid inequalities, and computational analysis (Q535673) (← links)
- Maximizing a class of submodular utility functions (Q543403) (← links)
- A computational comparison of Gomory and knapsack cuts (Q580177) (← links)
- Recoverable robust knapsacks: the discrete scenario case (Q691430) (← 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)
- RENS. The optimal rounding (Q744216) (← links)
- A combinatorial optimization approach to the selection of statistical units (Q747022) (← 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)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Integer-programming software systems (Q817202) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Polyhedral analysis for concentrator location problems (Q853560) (← links)
- Exploiting nested inequalities and surrogate constraints (Q858413) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
- A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement (Q900590) (← links)
- The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
- Facet defining inequalities for the dichotomous knapsack problem (Q911989) (← links)
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements (Q924628) (← links)
- Second-order cover inequalities (Q927162) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- A multi-stop routing problem (Q940857) (← links)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
- The submodular knapsack polytope (Q1040079) (← links)
- The complexity of facets (and some facets of complexity) (Q1061485) (← links)
- Facets of the knapsack polytope derived from disjoint and overlapping index configurations (Q1103523) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- A generalization of antiwebs to independence systems and their canonical facets (Q1122478) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
- Logic applied to integer programming and integer programming applied to logic (Q1130078) (← links)
- Adjacency of the 0-1 knapsack problem (Q1195107) (← links)
- A time indexed formulation of non-preemptive single machine scheduling problems (Q1196724) (← links)
- A characterization of knapsacks with the max-flow--min-cut property (Q1197887) (← links)
