Titlebook: Integer Programming and Combinatorial Optimization; 10th International I Daniel Bienstock,George Nemhauser Conference proceedings 2004 Spri

Intuitive

Metric Inequalities and the Network Loading Problemdges of . allowing routing of the traffic demands..In this paper we study the . of the Network Loading Problem, introducing the new class of the Tight Metric Inequalities, that completely characterize the convex hull of the integer feasible solutions of the problem. We present separation algorithms

evince

矛盾心理

出血

Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problematency functions are linear and there is a single source and sink. Still, one can prove that an optimal flow and an equilibrium flow share a desirable property in this situation: all flow-carrying paths have the same length; i.e., these solutions are “fair,” which is in general not true for the opti

Gnrh670

內(nèi)向者

Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problemsstage stochastic optimization, and provide nearly tight approximations. Our problems range from the simple (shortest path, vertex cover, bin packing) to complex (facility location, set cover), and contain representatives with different approximation ratios..The approximation ratio of the stochastic

六邊形

reptile

A TDI Description of Restricted 2-Matching Polytopes perfect 2-matching polytope and relaxations of the travelling salesman polytope are members of this class. The paper shows that 2-matching problems for which the unweighted problem was known to be tractable, the weighted is also tractable.

厚臉皮

Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problemst the first of these problems can be solved in incremental polynomial time, while the second problem is NP-hard: given a collection of minimal dicuts for ., it is NP-complete to tell whether it can be extended. The latter result implies, in particular, that for a given set of points ., it is NP-hard

接合