Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
From MaRDI portal
Publication:1413848
DOI10.1016/S0305-0548(02)00112-0zbMath1047.90054OpenAlexW2153204245MaRDI QIDQ1413848
José Luis Santos, Maria Eugénia Captivo, Joao Carlos Namorado Climaco, Ernesto Queirós Vieira Martins, José Rui Figueira
Publication date: 17 November 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00112-0
Related Items (31)
Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Algorithm robust for the bicriteria discrete optimization problem ⋮ Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems ⋮ Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems ⋮ Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem ⋮ CUT: A Multicriteria Approach for Concavifiable Preferences ⋮ Network Models for Multiobjective Discrete Optimization ⋮ Swarm intelligence-based hyper-heuristic for the vehicle routing problem with prioritized customers ⋮ An improved multiobjective shortest path algorithm ⋮ Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem ⋮ Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem ⋮ Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems ⋮ A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming ⋮ A biobjective Dijkstra algorithm ⋮ A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem ⋮ On the multicriteria allocation problem ⋮ Solving efficiently the 0-1 multi-objective knapsack problem ⋮ Core problems in bi-criteria \(\{0,1\}\)-knapsack problems ⋮ Bridging game theory and the knapsack problem: a theoretical formulation ⋮ Using support vector machines to learn the efficient set in multiple objective discrete optimization ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Solving 0-1 knapsack problems based on amoeboid organism algorithm ⋮ Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa ⋮ The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem ⋮ Exact algorithm for bi-objective 0-1 knapsack problem ⋮ Implementing an efficient fptas for the 0-1 multi-objective knapsack problem ⋮ Labeling algorithms for multiple objective integer knapsack problems ⋮ Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms ⋮ A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems ⋮ The multiobjective multidimensional knapsack problem: a survey and a new approach ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a multicriteria shortest path problem
- A bicriterion shortest path algorithm
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Relocation problems arising in conservation biology
- Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
- DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
This page was built for publication: Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
