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.
- Inverse 1-median problem on block graphs with variable vertex weights (Q283940) (← links)
- Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
- Continuous location of an assembly station (Q356516) (← links)
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (Q428109) (← links)
- Kernel search: a new heuristic framework for portfolio selection (Q434181) (← links)
- Inverse 1-median problem on trees under weighted Hamming distance (Q445338) (← links)
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems (Q537958) (← links)
- Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships (Q556008) (← links)
- Uniqueness of integer solution of linear equations (Q601980) (← links)
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
- Inverse median location problems with variable coordinates (Q623783) (← links)
- An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics (Q670759) (← links)
- On a cardinality constrained linear programming knapsack problem (Q753684) (← links)
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems (Q761347) (← links)
- A heuristic algorithm for the multidimensional zero-one knapsack problem (Q789318) (← links)
- A fast algorithm for the linear multiple-choice knapsack problem (Q800227) (← links)
- The stochastic linear continuous type knapsack problem: A generalized P model (Q800831) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
- The inverse connected \(p\)-median problem on block graphs under various cost functions (Q827099) (← links)
- Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem (Q835755) (← links)
- A simple linear time algorithm for scheduling with step-improving processing times (Q869002) (← links)
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem (Q875412) (← links)
- Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
- Upgrading \(p\)-median problem on a path (Q894530) (← links)
- An exact algorithm for large unbounded knapsack problems (Q913659) (← links)
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem (Q928018) (← links)
- Qos-aware service evaluation and selection (Q932236) (← links)
- Reverse 2-median problem on trees (Q943832) (← links)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem (Q955337) (← links)
- A column generation method for the multiple-choice multi-dimensional knapsack problem (Q969718) (← links)
- Kernel search: a general heuristic for the multi-dimensional knapsack problem (Q976023) (← links)
- Efficient heuristic algorithms for path-based hardware/software partitioning (Q988463) (← links)
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem (Q995928) (← links)
- A faster polynomial algorithm for the unbalanced Hitchcock transportation problem (Q1003485) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (Q1038094) (← links)
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
- Knapsack problems with setups (Q1041933) (← links)
- Inverse 1-center location problems with edge length augmentation on trees (Q1044223) (← links)
- An effective heuristic for large-scale capacitated facility location problems (Q1044245) (← links)
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core (Q1044419) (← links)
- Zero-one integer programs with few contraints - lower bounding theory (Q1060954) (← links)
- Zero-one integer programs with few constraints - Efficient branch and bound algorithms (Q1073718) (← links)
- Some computational results on real 0-1 knapsack problems (Q1079123) (← links)
- Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
- An integer programming model for the allocation of databases in a distributed computer system (Q1083877) (← links)
- The reduced cost branch and bound algorithm for mixed integer programming (Q1085067) (← links)
