In interval scheduling, not only the processing times of the jobs but also their starting times
are given. This article surveys the area of interval scheduling and presents proofs of results …

Combinatorial optimization problems are pervasive across science and industry. Modern
deep learning tools are poised to solve these problems at unprecedented scales, but a …

Constraint-based approaches recently brought new insight into our understanding of
metabolism. By making very simple assumptions such as that the system is at steady-state …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

The primal–dual method is a powerful algorithmic technique that has proved to be extremely
useful for a wide variety of problems in the area of approximation algorithms for NP-hard …

The study of combinatorial problems with a submodular objective function has attracted
much attention in recent years, and is partly motivated by the importance of such problems to …

We develop a new randomized rounding approach for fractional vectors defined on the edge-
sets of bipartite graphs. We show various ways of combining this technique with other ideas …

We present a simple family of algorithms for solving the Generalized Assignment Problem
(GAP). Our technique is based on a novel combinatorial translation of any algorithm for the …

Given an arc-weighted directed graph G=(V, A,/spl lscr/) and a pair of nodes s, t, we seek to
find an st walk of length at most B that maximizes some given function f of the set of nodes …

摘要优化方法为设计更好的计算机网络服务质量保证机制提供了有力的理论支持.
相较于传统启发式的网络设计方法, 优化方法可以从理论上找到问题的最优解 …