Pages that link to "Item:Q4393123"
From MaRDI portal
The following pages link to A Minimal Algorithm for the 0-1 Knapsack Problem (Q4393123):
Displayed 31 items.
- Model and algorithms for multi-period sea cargo mix problem (Q872163) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- Exact algorithms for the joint object placement and request routing problem in content distribution networks (Q925830) (← links)
- Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
- A computational study of exact knapsack separation for the generalized assignment problem (Q967219) (← links)
- A branch-and-price algorithm for the two-dimensional level strip packing problem (Q1029564) (← links)
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
- An exact algorithm for large multiple knapsack problems (Q1124710) (← links)
- A fast algorithm for strongly correlated knapsack problems (Q1281395) (← links)
- Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth (Q1388884) (← links)
- Discrete facility location and routing of obnoxious activities. (Q1417557) (← links)
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study (Q1433163) (← links)
- New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Where are the hard knapsack problems? (Q1772862) (← links)
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers (Q1776965) (← links)
- Heuristics for the container loading problem (Q1847185) (← links)
- Solving the swath segment selection problem through Lagrangean relaxation (Q2456644) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
- Algorithms for solving the single-sink fixed-charge transportation problem (Q2462557) (← links)
- An optimization algorithm for a penalized knapsack problem (Q2466588) (← links)
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem (Q2467571) (← links)
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems (Q2468486) (← links)
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606) (← links)
- An efficient algorithm for the collapsing knapsack problem (Q2489216) (← links)
- Tree knapsack approaches for local access network design (Q2503262) (← links)
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem (Q2506174) (← links)
- Approximate and exact algorithms for the fixed-charge knapsack problem (Q2572244) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core (Q3628453) (← links)
- An exact algorithm for the subset sum problem (Q5955091) (← links)