The following pages link to (Q3993418):
Displaying 50 items.
- The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature (Q2445842) (← links)
- The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments (Q2445845) (← links)
- Combined location and routing problems for drug distribution (Q2448896) (← links)
- Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms (Q2456412) (← links)
- Solving the swath segment selection problem through Lagrangean relaxation (Q2456644) (← links)
- Automated reformulation of specifications by safe delay of constraints (Q2457622) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
- Lower and upper bounds for a two-level hierarchical location problem in computer networks (Q2462545) (← links)
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem (Q2462550) (← links)
- Algorithms for solving the single-sink fixed-charge transportation problem (Q2462557) (← links)
- An enumeration scheme to generate constrained exact checkerboard patterns (Q2462561) (← links)
- How to allocate hard candies fairly (Q2463574) (← links)
- An optimization algorithm for a penalized knapsack problem (Q2466588) (← links)
- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem (Q2467125) (← links)
- Algorithms for the bounded set-up knapsack problem (Q2467131) (← links)
- A new exact method for the two-dimensional bin-packing problem with fixed orientation (Q2467477) (← links)
- A survey of recent developments in multiobjective optimization (Q2468335) (← links)
- Solving the one-dimensional bin packing problem with a weight annealing heuristic (Q2468485) (← links)
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems (Q2468486) (← links)
- Rerouting tunnels for MPLS network resource optimization (Q2469604) (← links)
- A new ant colony optimization algorithm for the multidimensional Knapsack problem (Q2471237) (← links)
- Stochastic facility location with general long-run costs and convex short-run costs (Q2475855) (← links)
- Scheduling a two-stage flowshop under makespan constraint (Q2476691) (← links)
- A relaxed projection method for general integer quadratic knapsack problem. (Q2477123) (← links)
- A ``maximum node clustering'' problem (Q2479564) (← links)
- Distance preserving recombination operator for Earth observation satellites operations scheduling (Q2481604) (← links)
- A genetic algorithm for the project assignment problem (Q2485176) (← links)
- An exact algorithm for the knapsack sharing problem (Q2485179) (← links)
- On the complexity of the continuous unbounded knapsack problem with uncertain coefficients (Q2488199) (← links)
- Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets (Q2488902) (← links)
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319) (← links)
- On the capacitated concentrator location problem: a reformulation by discretization (Q2496022) (← links)
- An exact algorithm for the capacitated vertex \(p\)-center problem (Q2496034) (← links)
- Exact solutions to a class of stochastic generalized assignment problems (Q2496071) (← links)
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem (Q2503277) (← links)
- Dynamic programming algorithms for the optimal cutting of equal rectangles (Q2504483) (← links)
- Design of test inputs and their sequences in multi-function system testing (Q2505033) (← links)
- Dynamic programming algorithms for generating optimal strip layouts (Q2506184) (← links)
- Upper and lower bounding procedures for the multiple knapsack assignment problem (Q2514873) (← links)
- On the complexity of project scheduling to minimize exposed time (Q2514874) (← links)
- An approximate dynamic programming approach to convex quadratic knapsack problems (Q2566930) (← links)
- The two-dimensional bin packing problem with variable bin sizes and costs (Q2568334) (← links)
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing (Q2569059) (← links)
- Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors (Q2569094) (← links)
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems (Q2570142) (← links)
- A path relinking approach with ejection chains for the generalized assignment problem (Q2570155) (← links)
- Approximate and exact algorithms for the fixed-charge knapsack problem (Q2572244) (← links)
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem (Q2572248) (← links)
- The influence of the fitness evaluation method on the performance of multiobjective search algorithms (Q2572858) (← links)
- Comparing metaheuristic algorithms for SONET network design problems (Q2573001) (← links)
