scientific article; zbMATH DE number 1418266
From MaRDI portal
Publication:4941826
zbMath0945.90050MaRDI QIDQ4941826
Publication date: 19 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Scheduling multiple two-stage flowshops with a deadline ⋮ Online algorithms with advice for the dual bin packing problem ⋮ Scheduling on multiple two-stage flowshops with a deadline ⋮ Approximate composable truthful mechanism design ⋮ Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem ⋮ A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint ⋮ Upper bounds and algorithms for the maximum cardinality bin packing problem. ⋮ On maximizing the throughput of multiprocessor tasks. ⋮ Coordinated scheduling of production and delivery with production window and delivery capacity constraints ⋮ Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines ⋮ A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version ⋮ A fast asymptotic approximation scheme for bin packing with rejection ⋮ Approximation algorithms for scheduling with reservations ⋮ A Survey on Approximation Algorithms for Scheduling with Machine Unavailability ⋮ Optimizing a mail-order with discount and shipping costs ⋮ A PTAS for the multiple subset sum problem with different knapsack capacities
