Zero-one integer programs with few contraints - lower bounding theory
From MaRDI portal
Publication:1060954
DOI10.1016/0377-2217(85)90033-5zbMath0569.90057OpenAlexW2085977298MaRDI QIDQ1060954
Publication date: 1985
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(85)90033-5
Lagrange multiplierscombinatorial optimizationresource allocationlower boundsbranch and bound algorithmheuristic proceduresLagrangean, surrogate and composite relaxationsmulticonstraint knapsacksurrogate multipliers
Numerical mathematical programming methods (65K05) Integer programming (90C10) Boolean programming (90C09)
Related Items (6)
Heuristics for the multi-resource generalized assignment problem ⋮ A solution procedure for general knapsack problems with a few constraints ⋮ Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben ⋮ Correction to an article of Gavish and Pirkul ⋮ A survey of algorithms for the generalized assignment problem ⋮ Zero-one integer programs with few constraints - Efficient branch and bound algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Zero-one integer programs with few constraints - Efficient branch and bound algorithms
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- Zero-one programming with many variables and few constraints
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Some relationships between lagrangian and surrogate duality in integer programming
- A Dual-Based Procedure for Uncapacitated Facility Location
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- Pivot and Complement–A Heuristic for 0-1 Programming
- An Algorithm for Large Zero-One Knapsack Problems
- Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
- Calculating surrogate constraints
- Reduction Algorithm for Zero-One Single Knapsack Problems
- The knapsack problem: A survey
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- Surrogate Constraint Duality in Mathematical Programming
- Computing Partitions with Applications to the Knapsack Problem
- An Efficient Algorithm for the 0-1 Knapsack Problem
- A Sequential Approach to the $0 - 1$ Linear Programming Problem
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- Validation of subgradient optimization
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- The Theory and Computation of Knapsack Functions
- An Improved Implicit Enumeration Approach for Integer Programming
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- An Enumeration Algorithm for Knapsack Problems
- Quasi-Convex Programming
- Integer Programming by Implicit Enumeration and Balas’ Method
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Surrogate Mathematical Programming
- An implicit enumeration program for zero-one integer programming
- The Generalized Penalty-Function/Surrogate Model
This page was built for publication: Zero-one integer programs with few contraints - lower bounding theory
