Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
From MaRDI portal
Publication:1383928
DOI10.1023/A:1008258310679zbMath0908.90191OpenAlexW1486643454MaRDI QIDQ1383928
M. Visée, E. L. Ulungu, Marc Pirlot, Jacques jun. Teghem
Publication date: 5 August 1998
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008258310679
combinatorial optimizationmultiobjective programmingefficient solutionsknapsack problem0-1 knapsack problemtwo objectives
Related Items
An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs ⋮ Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach ⋮ MOBILE SECONDARY IDEAL POINT AND MOMA-PLUS METHOD IN TWO-PHASE METHOD FOR SOLVING BI-OBJECTIVE ASSIGNMENT PROBLEMS ⋮ Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems ⋮ Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives ⋮ Bi-objective optimization of retailer's profit and customer surplus in assortment and pricing planning ⋮ Dominance for multi-objective robust optimization concepts ⋮ AN OPTIMIZATION MODEL FOR REUSE SCENARIO SELECTION CONSIDERING RELIABILITY AND COST IN SOFTWARE PRODUCT LINE DEVELOPMENT ⋮ The biobjective travelling purchaser problem ⋮ Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Unnamed Item ⋮ 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 ⋮ Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems ⋮ Heuristic approaches for biobjective mixed 0-1 integer linear programming problems ⋮ The multi-objective generalized consistent vehicle routing problem ⋮ Solution approaches for equitable multiobjective integer programming problems ⋮ Fuzzy approach to multilevel knapsack problems ⋮ A biobjective method for sample allocation in stratified sampling ⋮ Choquet optimal set in biobjective combinatorial optimization ⋮ 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 ⋮ Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem ⋮ Parallel partitioning method (PPM): A new exact method to solve bi-objective problems ⋮ Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem ⋮ Bound sets for biobjective combinatorial optimization problems ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Finding all nondominated points of multi-objective integer programs ⋮ Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems ⋮ Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs ⋮ Branch-and-bound and objective branching with three or more objectives ⋮ Two‐phase strategies for the bi‐objective minimum spanning tree problem ⋮ Store-wide space planning balancing Impulse and convenience ⋮ Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions ⋮ A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem ⋮ Computation of ideal and Nadir values and implications for their use in MCDM methods. ⋮ A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives ⋮ Solving bicriteria 0--1 knapsack problems using a labeling algorithm. ⋮ Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems ⋮ Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets ⋮ Branch-and-Bound for Bi-objective Integer Programming ⋮ Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint ⋮ Two phase algorithms for the bi-objective assignment problem ⋮ A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem ⋮ Solving efficiently the 0-1 multi-objective knapsack 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 ⋮ Bridging game theory and the knapsack problem: a theoretical formulation ⋮ Fathoming rules for biobjective mixed integer linear programs: review and extensions ⋮ Multi-objective branch and bound ⋮ Using support vector machines to learn the efficient set in multiple objective discrete optimization ⋮ The search-and-remove algorithm for biobjective mixed-integer linear programming problems ⋮ Multi-group support vector machines with measurement costs: A biobjective approach ⋮ Multi‐objective optimization using metaheuristics: non‐standard algorithms ⋮ Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems ⋮ Greedy algorithms for a class of knapsack problems with binary weights ⋮ B{\&}B method for discrete partial order optimization ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ 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 ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ What foreclosed homes should a municipality purchase to stabilize vulnerable neighborhoods? ⋮ An interactive heuristic method for multi-objective combinatorial optimization ⋮ Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms ⋮ Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core ⋮ An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem ⋮ 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 ⋮ The multiobjective multidimensional knapsack problem: a survey and a new approach ⋮ A bicriteria knapsack program for planning remediation of contaminated lightstation sites ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
