Titlebook: Integer Programming and Combinatorial Optimization; 17th International C Jon Lee,Jens Vygen Conference proceedings 2014 Springer Internatio

institute

Centrality of Trees for Capacitated ,-Center,ated non-negative integer capacity. The goal is to choose (open) . locations (called centers) and assign each location to an open center to minimize the maximum, over all locations, of the distance of the location to its assigned center. The number of locations assigned to a center cannot exceed the

Congestion

使闭塞

On the Unique-Lifting Property,erty of unique minimal liftings for general maximal lattice-free polytopes. This generalizes a previous result by Basu, Cornuéjols and Köppe [3] for . maximal lattice-free polytopes, thus completely settling this fundamental question about lifting. We also extend results from [3] for minimal lifting

invert

Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs,lvable. It was shown in [6] that it is NP-complete if the maximum degree is four. We extend these ideas to the problem of balancing signed graphs..We also consider maximum weighted induced acyclic subgraphs of planar directed graphs. If the maximum degree is three, it is easily shown that this is po

EXALT

,-Step Cycle Inequalities: Facets for Continuous ,-Mixing Set and Strong Cuts for Multi-Module Capa closely related to the feasible set of the . (MML) problem with(out) backlogging. For each .′ ∈ {1,…,. }, we develop a class of valid inequalities for this set, referred to as the .′-step cycle inequalities, and show that they are facet-defining for .(..) in many cases. We also present a compact ex

NEEDY

柔美流畅

经典

Network Improvement for Equilibrium Routing, average agent delay at equilibrium. A number of methods to control this average delay have received substantial attention, including network tolls, Stackelberg routing, and edge removal..A related approach with arguably greater practical relevance is that of making investments in improvements to th

bizarre

Finding Small Stabilizers for Unstable Graphs,set of edges . ⊆ . a . if its removal from . yields a stable graph. In this paper we study the following natural edge-deletion question: given a graph . = (.,.), can we find a minimum-cardinality stabilizer?.Stable graphs play an important role in cooperative game theory. In the classic . introduced

cutlery

The Triangle Splitting Method for Biobjective Mixed Integer Programming,r program. The algorithm is relatively easy to implement and converges quickly to the complete set of nondominated points. A computational study demonstrates the efficacy of the triangle splitting method.