Zero-one programming with many variables and few constraints
From MaRDI portal
Cites work
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- An Improved Implicit Enumeration Approach for Integer Programming
- Canonical Cuts on the Unit Hypercube
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- Experimental results on Hillier's linear search
- Letter to the Editor—On the Merit of the Generalized Origin and Restarts in Implicit Enumeration
Cited in
(21)- Minimum cost delivery of multi-item orders in e-commerce logistics
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem
- Hybrid approaches for the two-scenario max-min knapsack problem
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- Modeling multiple plant sourcing decisions
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Zero-one integer programs with few contraints - lower bounding theory
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- Alternating control tree search for knapsack/covering problems
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- The multidimensional 0-1 knapsack problem: an overview.
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- 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
- New convergent heuristics for 0-1 mixed integer programming
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- The reduced cost branch and bound algorithm for mixed integer programming
This page was built for publication: Zero-one programming with many variables and few constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1247918)
