Technical Note—A Note on Zero-One Programming
From MaRDI portal
Publication:4071008
DOI10.1287/opre.23.4.833zbMath0311.90053OpenAlexW1975365958MaRDI QIDQ4071008
Publication date: 1975
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.23.4.833
Related Items
Knapsack polytopes: a survey, On the complexity of sequentially lifting cover inequalities for the knapsack polytope, The project scheduling polyhedron: Dimension, facets and lifting theorems, Facets of the knapsack polytope derived from disjoint and overlapping index configurations, Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm, Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems, On the complexity of separation from the knapsack polytope, Solving the asymmetric traveling purchaser problem, New facets for the two-stage uncapacitated facility location polytope, On ternary problems, Lifting the knapsack cover inequalities for the knapsack polytope, Lexicographical order in integer programming, The quadratic knapsack problem -- a survey, A generalization of antiwebs to independence systems and their canonical facets, The Boolean quadratic polytope: Some characteristics, facets and relatives, On cutting-plane proofs in combinatorial optimization, \(O(n \log n)\) procedures for tightening cover inequalities, Chance-Constrained Binary Packing Problems, Valid inequalities for mixed-integer programmes with fixed charges on sets of variables, A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems, Lifting for conic mixed-integer programming, Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation, The generalized assignment problem: Valid inequalities and facets, Facet defining inequalities for the dichotomous knapsack problem, Bidirected and unidirected capacity installation in telecommunication networks., (1,k)-configuration facets for the generalized assignment problem, A note on the generalized Steiner tree polytope, A note on the knapsack problem with special ordered sets, Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience, Facets of the knapsack polytope, Generalized cover facet inequalities for the generalized assignment problem, Valid inequalities for quadratic optimisation with domain constraints, Classical cuts for mixed-integer programming and branch-and-cut, Solving a school bus scheduling problem with integer programming, On tightening cover induced inequalities, The complexity of lifted inequalities for the knapsack problem, Lineare Charakterisierungen von Travelling Salesman Problemen, New facets for the set packing polytope, Polyhedral results for the precedence-constrained knapsack problem, Cutting planes in integer and mixed integer programming, A branch-and-cut algorithm for the median-path problem, A class of facet producing graphs for vertex packing polyhedra, A hybrid algorithm for the generalized assignment problem, Polyhedral properties of the induced cluster subgraphs, Lifting the facets of zero–one polytopes, (1,k)-configurations and facets for packing problems, Lifting convex inequalities for bipartite bilinear programs, On lifted cover inequalities: a new lifting procedure with unusual properties, Efficient reformulation for 0-1 programs -- methods and computational results, Lifting convex inequalities for bipartite bilinear programs, An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope., Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing, On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs, Path planning for unmanned vehicles with localization constraints, Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope, Risk-Averse Shortest Path Interdiction, Valid inequalities, cutting planes and integrality of the knapsack polytope, A new lifting theorem for vertex packing, A note on node packing polytopes on hypergraphs, On the facets of the simple plant location packing polytope, A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming, A concurrent processing framework for the set partitioning problem, Computing low-capacity 0–1 knapsack polytopes, Cover and pack inequalities for (mixed) integer programming, Airline crew scheduling: state-of-the-art
