Pages that link to "Item:Q1247918"
From MaRDI portal
The following pages link to Zero-one programming with many variables and few constraints (Q1247918):
Displaying 21 items.
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (Q894546) (← links)
- Alternating control tree search for knapsack/covering problems (Q972644) (← links)
- Zero-one integer programs with few contraints - lower bounding theory (Q1060954) (← links)
- The reduced cost branch and bound algorithm for mixed integer programming (Q1085067) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem (Q1761940) (← links)
- A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem (Q2003457) (← links)
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (Q2070116) (← links)
- New convergent heuristics for 0-1 mixed integer programming (Q2378374) (← links)
- Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs (Q2654395) (← links)
- Minimum cost delivery of multi-item orders in e-commerce logistics (Q2669718) (← links)
- Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)
- Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization (Q3509451) (← links)
- Modeling multiple plant sourcing decisions (Q3532786) (← links)
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality (Q3688105) (← links)