Pages that link to "Item:Q1413848"
From MaRDI portal
The following pages link to Solving bicriteria 0--1 knapsack problems using a labeling algorithm. (Q1413848):
Displaying 32 items.
- Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382) (← links)
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (Q428109) (← links)
- Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems (Q453890) (← links)
- On the multicriteria allocation problem (Q490242) (← links)
- Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem (Q625647) (← links)
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (Q662206) (← links)
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (Q857299) (← links)
- Solving efficiently the 0-1 multi-objective knapsack problem (Q947962) (← links)
- Using support vector machines to learn the efficient set in multiple objective discrete optimization (Q958095) (← links)
- The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem (Q989830) (← links)
- Exact algorithm for bi-objective 0-1 knapsack problem (Q990717) (← links)
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem (Q1027579) (← links)
- Labeling algorithms for multiple objective integer knapsack problems (Q1040971) (← links)
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
- Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems (Q1652447) (← links)
- A biobjective Dijkstra algorithm (Q1728479) (← links)
- Bridging game theory and the knapsack problem: a theoretical formulation (Q1990251) (← links)
- Solving 0-1 knapsack problems based on amoeboid organism algorithm (Q2016352) (← links)
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
- Algorithm robust for the bicriteria discrete optimization problem (Q2379865) (← links)
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems (Q2468486) (← links)
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems (Q2570142) (← links)
- Swarm intelligence-based hyper-heuristic for the vehicle routing problem with prioritized customers (Q2669452) (← links)
- An improved multiobjective shortest path algorithm (Q2669519) (← links)
- The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)
- CUT: A Multicriteria Approach for Concavifiable Preferences (Q2935305) (← links)
- Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa (Q4419274) (← links)
- Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
- A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming (Q5137441) (← links)
- Parallel implementation of an exact two-phase method for the biobjective knapsack problem (Q6658451) (← links)
