scientific article; zbMATH DE number 1830735
From MaRDI portal
Publication:4778556
zbMath1018.90034MaRDI QIDQ4778556
Hans Kellerer, Erlebach, Thomas, Ulrich Pferschy
Publication date: 18 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2125/21250210
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (8)
An FPTAS for the parametric knapsack problem ⋮ IT-CEMOP: an iterative co-evolutionary algorithm for multiobjective optimization problem with nonlinear constraints ⋮ Bicriteria approximation algorithms for scheduling problems with communications delays ⋮ On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. ⋮ Scheduling parallel dedicated machines with the speeding‐up resource ⋮ The packing while traveling problem ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ An FPTAS for the knapsack problem with parametric weights
This page was built for publication:
