Pages that link to "Item:Q1156694"
From MaRDI portal
The following pages link to An algorithm for the solution of the 0-1 knapsack problem (Q1156694):
Displayed 49 items.
- Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← links)
- A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems (Q800229) (← links)
- A comparison of heuristics and relaxations for the capacitated plant location problem (Q811347) (← links)
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem (Q875412) (← links)
- A Lagrangean dual ascent algorithm for simple plant location problems (Q911446) (← links)
- An exact algorithm for large unbounded knapsack problems (Q913659) (← links)
- Improved Lagrangean decomposition: An application to the generalized assignment problem (Q922948) (← links)
- Single-vendor multi-buyer inventory coordination under private information (Q933523) (← 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 multi-level search strategy for the 0-1 multidimensional knapsack problem (Q968116) (← links)
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems (Q1067997) (← links)
- Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
- A new enumeration scheme for the knapsack problem (Q1095029) (← links)
- Constructive dual methods for discrete programming (Q1101341) (← links)
- UGC: An algorithm for two-stage unconstrained guillotine cutting (Q1127189) (← links)
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems (Q1127219) (← links)
- A constrained Steiner tree problem (Q1129916) (← links)
- An improved bounding procedure for the constrained assignment problem (Q1184442) (← links)
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem (Q1309925) (← links)
- A set partitioning heuristic for the generalized assignment problem (Q1319576) (← 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)
- A minimal algorithm for the multiple-choice knapsack problem (Q1388832) (← links)
- The bottleneck generalized assignment problem (Q1388853) (← 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)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (Q1761937) (← links)
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study (Q1799388) (← links)
- Efficient reformulation for 0-1 programs -- methods and computational results (Q1803672) (← links)
- Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem (Q2079394) (← links)
- Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
- Probability of unique integer solution to a system of linear equations (Q2275621) (← links)
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints (Q2367382) (← links)
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem (Q2433806) (← links)
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems (Q2468486) (← links)
- An exact algorithm for the knapsack sharing problem (Q2485179) (← links)
- An efficient algorithm for the collapsing knapsack problem (Q2489216) (← links)
- CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem (Q2815454) (← links)
- Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study (Q2883592) (← links)
- On Bilevel Optimization with Inexact Follower (Q5120277) (← links)
- Random knapsack in expected polynomial time (Q5917572) (← links)
- An exact algorithm for the subset sum problem (Q5955091) (← links)
- A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)