Integrating partial optimization with scatter search for solving bi-criteria {0,1}-knapsack problems
- 1 March 2007
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 177 (3) , 1656-1677
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- A scatter search method for bi-criteria {0,1}-knapsack problemsEuropean Journal of Operational Research, 2006
- Solving bicriteria 0–1 knapsack problems using a labeling algorithmComputers & Operations Research, 2003
- A bicriteria knapsack program for planning remediation of contaminated lightstation sitesEuropean Journal of Operational Research, 2002
- Tabu Search Based Procedure for Solving the 0-1 MultiObjective Knapsack Problem: The Two Objectives CaseJournal of Heuristics, 2000
- The problem of the optimal biobjective spanning treeEuropean Journal of Operational Research, 1998
- Heuristic algorithms for the maximum diversity problemJournal of Information and Optimization Sciences, 1998
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimizationJournal of Multi-Criteria Decision Analysis, 1998
- Analyzing and Modeling the Maximum Diversity Problem by Zero‐One Programming*Decision Sciences, 1993
- A bicriterion shortest path algorithmEuropean Journal of Operational Research, 1982
- HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTSDecision Sciences, 1977