Pages that link to "Item:Q5560786"
From MaRDI portal
The following pages link to The Theory and Computation of Knapsack Functions (Q5560786):
Displaying 50 items.
- Origin and early evolution of corner polyhedra (Q323202) (← links)
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
- Rapid calculation of exact cell bounds for contingency tables from conditional frequencies (Q337192) (← links)
- Determining the \(K\)-best solutions of knapsack problems (Q342015) (← links)
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
- Tight bounds for periodicity theorems on the unbounded knapsack problem (Q421659) (← links)
- Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem (Q439644) (← links)
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780) (← links)
- Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← links)
- Bun splitting: a practical cutting stock problem (Q610959) (← links)
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← links)
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem (Q726225) (← links)
- An algorithm for the two-dimensional assortment problem (Q759646) (← links)
- Fixed charge problems with identical fixed charges (Q797500) (← links)
- Heuristics for sequencing cutting patterns (Q807386) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- A partial enumeration algorithm for pure nonlinear integer programming (Q838194) (← links)
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766) (← links)
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem (Q875412) (← links)
- An exact algorithm for large unbounded knapsack problems (Q913659) (← links)
- Scatter search for the 0-1 multidimensional knapsack problem (Q928688) (← links)
- Characterization and modelling of guillotine constraints (Q930945) (← links)
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles (Q941476) (← links)
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search (Q953317) (← links)
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem (Q960412) (← links)
- A multi-level search strategy for the 0-1 multidimensional knapsack problem (Q968116) (← links)
- Alternating control tree search for knapsack/covering problems (Q972644) (← links)
- Kernel search: a general heuristic for the multi-dimensional knapsack problem (Q976023) (← links)
- A hybrid algorithm for the unbounded knapsack problem (Q1013302) (← links)
- An improved partial enumeration algorithm for integer programming problems (Q1026562) (← links)
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem (Q1042147) (← links)
- Trim-loss pattern rearrangement and its relevance to the flat-glass industry (Q1055339) (← links)
- A note on modifying a two-dimensional trim-loss algorithm to deal with cutting restrictions (Q1055340) (← links)
- Zero-one integer programs with few contraints - lower bounding theory (Q1060954) (← links)
- An algorithm for the periodic solutions in the knapsack problem (Q1075253) (← links)
- Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
- Determining an upper bound for a class of rectangular packing problems (Q1086163) (← links)
- A new enumeration scheme for the knapsack problem (Q1095029) (← links)
- Practical adaptations of the Gilmore-Gomory approach to cutting stock problems (Q1101335) (← links)
- Degeneracy in infinite horizon optimization (Q1123819) (← links)
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems (Q1127219) (← links)
- Exact solutions for constrained two-dimensional cutting problems (Q1127220) (← links)
- An analytical model for the container loading problem (Q1129950) (← links)
- A better step-off algorithm for the knapsack problem (Q1137512) (← links)
- The trim-loss and assortment problems: A survey (Q1143942) (← links)
- Cutting stock problems and solution procedures (Q1178994) (← links)
- Knowledge based approach to the cutting stock problem (Q1197096) (← links)
