scientific article; zbMATH DE number 1149800
From MaRDI portal
Publication:4387182
zbMath0899.90143MaRDI QIDQ4387182
Ulungu-Ekunda Lukata, Jacques jun. Teghem
Publication date: 7 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack 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 ⋮ Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets ⋮ A survey of recent developments in multiobjective optimization ⋮ Core problems in bi-criteria \(\{0,1\}\)-knapsack problems ⋮ Multi-objective branch and bound ⋮ B{\&}B method for discrete partial order optimization ⋮ An interactive heuristic method for multi-objective combinatorial optimization ⋮ Labeling algorithms for multiple objective integer knapsack problems
This page was built for publication:
