Zero-one programming with many variables and few constraints
From MaRDI portal
Publication:1247918
DOI10.1016/0377-2217(78)90093-0zbMath0381.90076OpenAlexW2012761904MaRDI QIDQ1247918
Publication date: 1978
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(78)90093-0
Related Items
An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, The reduced cost branch and bound algorithm for mixed integer programming, New convergent heuristics for 0-1 mixed integer programming, Hybrid approaches for the two-scenario max-min knapsack problem, Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs, Mathematical programming based heuristics for the 0--1 MIP: a survey, Minimum cost delivery of multi-item orders in e-commerce logistics, Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm, Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization, Modeling multiple plant sourcing decisions, The multidimensional 0-1 knapsack problem: an overview., A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design, A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem, Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem, Improved convergent heuristics for the 0-1 multidimensional knapsack problem, Alternating control tree search for knapsack/covering problems, A matheuristic for the 0--1 generalized quadratic multiple knapsack problem, Zero-one integer programs with few contraints - lower bounding theory, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Cites Work
- Experimental results on Hillier's linear search
- An Improved Implicit Enumeration Approach for Integer Programming
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- Letter to the Editor—On the Merit of the Generalized Origin and Restarts in Implicit Enumeration
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Canonical Cuts on the Unit Hypercube
