The following pages link to (Q4495184):
Displayed 16 items.
- Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
- Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems (Q453890) (← links)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
- Bi-objective optimization of retailer's profit and customer surplus in assortment and pricing planning (Q828848) (← links)
- Guided moth-flame optimiser for multi-objective optimization problems (Q828882) (← links)
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (Q857299) (← links)
- Multi-objectives tabu search based algorithm for progressive resource allocation (Q857318) (← links)
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems (Q887201) (← links)
- Labeling algorithms for multiple objective integer knapsack problems (Q1040971) (← links)
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm. (Q1413848) (← links)
- An interactive heuristic method for multi-objective combinatorial optimization (Q1569903) (← links)
- Multi-objective integrated acyclic crew rostering and vehicle assignment problem in public bus transportation (Q1642066) (← links)
- A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem (Q1694319) (← links)
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems (Q2570142) (← links)
- Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem (Q2655608) (← links)
- Store-wide space planning balancing Impulse and convenience (Q6069225) (← links)