Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
From MaRDI portal
Publication:1383928
DOI10.1023/A:1008258310679zbMath0908.90191MaRDI QIDQ1383928
Marc Pirlot, Jacques jun. Teghem, M. Visée, E. L. Ulungu
Publication date: 5 August 1998
Published in: Journal of Global Optimization (Search for Journal in Brave)
combinatorial optimization; multiobjective programming; efficient solutions; knapsack problem; 0-1 knapsack problem; two objectives
Related Items
Unnamed Item, Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems, Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors., A biobjective method for sample allocation in stratified sampling, An exact parallel method for a bi-objective permutation flowshop problem, Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems, Parallel partitioning method (PPM): A new exact method to solve bi-objective problems, Bound sets for biobjective combinatorial optimization problems, Solving efficiently the 0-1 multi-objective knapsack problem, Using support vector machines to learn the efficient set in multiple objective discrete optimization, 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, What foreclosed homes should a municipality purchase to stabilize vulnerable neighborhoods?, Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms, Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core, Computation of ideal and Nadir values and implications for their use in MCDM methods., Solving bicriteria 0--1 knapsack problems using a labeling algorithm., An interactive heuristic method for multi-objective combinatorial optimization, A bicriteria knapsack program for planning remediation of contaminated lightstation sites, Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach, Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives, The biobjective travelling purchaser problem, Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic, Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem, Algorithm robust for the bicriteria discrete optimization problem, A discussion of scalarization techniques for multiple objective integer programming, Fuzzy approach to multilevel knapsack problems, Two phase algorithms for the bi-objective assignment problem, A survey of recent developments in multiobjective optimization, Core problems in bi-criteria \(\{0,1\}\)-knapsack problems, Primal-dual simplex method for multiobjective linear programming, Multi-group support vector machines with measurement costs: A biobjective approach, A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems, A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices, Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
