Pages that link to "Item:Q3896840"
From MaRDI portal
The following pages link to An Algorithm for Large Zero-One Knapsack Problems (Q3896840):
Displaying 50 items.
- Efficient algorithms for the capacitated concentrator location problem (Q1088878) (← links)
- Comment on 'Some computational results on real 0-1 knapsack problems' (Q1089254) (← links)
- A new enumeration scheme for the knapsack problem (Q1095029) (← links)
- A simulated annealing approach to the multiconstraint zero-one knapsack problem (Q1099588) (← links)
- Constructive dual methods for discrete programming (Q1101341) (← links)
- An improved direct descent algorithm for binary knapsack problems (Q1115799) (← links)
- The knapsack problem with generalized upper bounds (Q1122484) (← links)
- An exact algorithm for large multiple knapsack problems (Q1124710) (← links)
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems (Q1127219) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- An algorithm for the solution of the 0-1 knapsack problem (Q1156694) (← links)
- On search over rationals (Q1170866) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem (Q1208445) (← links)
- Solving dense subset-sum problems by using analytical number theory (Q1262760) (← links)
- Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem (Q1270784) (← links)
- A fast algorithm for strongly correlated knapsack problems (Q1281395) (← links)
- An exact algorithm for the 0-1 collapsing knapsack problem (Q1327229) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← links)
- Simple but efficient approaches for the collapsing knapsack problem (Q1364474) (← links)
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks (Q1370664) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- A minimal algorithm for the multiple-choice knapsack problem (Q1388832) (← links)
- The bottleneck generalized assignment problem (Q1388853) (← links)
- Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth (Q1388884) (← links)
- An expanding-core algorithm for the exact \(0-1\) knapsack problem (Q1390271) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935) (← links)
- An exact method for the two-echelon, single-source, capacitated facility location problem (Q1572966) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
- Exact approaches for the knapsack problem with setups (Q1652523) (← links)
- On the product knapsack problem (Q1653266) (← links)
- On minimal realisations of dynamical structure functions (Q1689363) (← links)
- Capacitated assortment and price optimization for customers with disjoint consideration sets (Q1728178) (← links)
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks (Q1730835) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem (Q1761118) (← links)
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (Q1761937) (← links)
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (Q1761939) (← links)
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem (Q1761940) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Where are the hard knapsack problems? (Q1772862) (← links)
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints (Q1774170) (← links)
- A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over (Q1782152) (← links)
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study (Q1799388) (← links)
- Undesirable facility location with minimal covering objectives (Q1806769) (← links)
- Formulating and solving production planning problems (Q1806882) (← links)
- Real-time task reallocation in fault-tolerant distributed computer systems (Q1821015) (← links)
