Tabu Search Based Procedure for Solving the 0-1 MultiObjective Knapsack Problem: The Two Objectives Case

This publication has 18 references indexed in Scilit:

• A Hybrid Heuristic for Multiobjective Knapsack Problems
  1999
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
  Journal of Multi-Criteria Decision Analysis, 1998
• A Tabu Search Procedure to Solve MultiObjective Combinatorial Optimization Problems
  1997
• Metaheuristics: A bibliography
  Annals of Operations Research, 1996
• Multi‐objective combinatorial optimization problems: A survey
  Journal of Multi-Criteria Decision Analysis, 1994
• An efficient preprocessing procedure for the multidimensional 0–1 knapsack problem
  Discrete Applied Mathematics, 1994
• Multiobjective Programming: Basic Concepts and Approaches
  1990
• Quad Trees, a Datastructure for Discrete Vector Optimization Problems
  1983
• Solving a bicriterion scheduling problem
  European Journal of Operational Research, 1980
• Lagrangean relaxation for integer programming
  1974