Pages that link to "Item:Q4393123"
From MaRDI portal
The following pages link to A Minimal Algorithm for the 0-1 Knapsack Problem (Q4393123):
Displaying 50 items.
- Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
- An approach to the asymmetric multi-depot capacitated arc routing problem (Q319291) (← links)
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
- An exact decomposition algorithm for the generalized knapsack sharing problem (Q322972) (← links)
- Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
- An implementation of exact knapsack separation (Q330511) (← links)
- Choquet optimal set in biobjective combinatorial optimization (Q336494) (← links)
- A dynamic programming algorithm for the knapsack problem with setup (Q342065) (← links)
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382) (← links)
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (Q428109) (← links)
- Column generation for extended formulations (Q458128) (← links)
- An exact method with variable fixing for solving the generalized assignment problem (Q694523) (← links)
- 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)
- New exact approaches and approximation results for the penalized knapsack problem (Q1634770) (← links)
- Bi-dimensional knapsack problems with one soft constraint (Q1652049) (← links)
- Combined cutting stock and lot-sizing problem with pattern setup (Q1652627) (← links)
- An incentive dynamic programming method for the optimization of scholarship assignment (Q1727142) (← links)
- Lifting of probabilistic cover inequalities (Q1728321) (← links)
- The multi-band robust knapsack problem -- a dynamic programming approach (Q1751135) (← links)
- Tolerance analysis for 0-1 knapsack problems (Q1751719) (← 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)
- An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
- Heuristics for the container loading problem (Q1847185) (← links)
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost (Q2003581) (← links)
- Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis (Q2027074) (← links)
- Solving bin packing problems using VRPSolver models (Q2033390) (← links)
- An efficient algorithm of dead-end controls for solving combinatorial optimization problems (Q2069680) (← links)
- Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem (Q2079394) (← links)
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q2108169) (← links)
- A new class of hard problem instances for the 0-1 knapsack problem (Q2140267) (← links)
- Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
- Maximum probabilistic all-or-nothing paths (Q2286936) (← links)
- Integrating workload smoothing and inventory reduction in three intermodal logistics platforms of a European car manufacturer (Q2329718) (← links)
- A cutting plane method for knapsack polytope (Q2391714) (← links)
- Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions (Q2423818) (← links)
