Sciweavers

TIT
2002
97views more  TIT 2002»
13 years 4 months ago
On a relation between information inequalities and group theory
Abstract--In this paper, we establish a one-to-one correspondence between information inequalities and group inequalities. The major implication of our result is that we can prove ...
Terence H. Chan, Raymond W. Yeung
MP
1998
105views more  MP 1998»
13 years 4 months ago
Capacitated facility location: Separation algorithms and computational experience
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
Karen Aardal
MP
2002
183views more  MP 2002»
13 years 4 months ago
On splittable and unsplittable flow capacitated network design arc-set polyhedra
We study the polyhedra of splittable and unsplittable single arc
Alper Atamtürk, Deepak Rajan
MP
2002
86views more  MP 2002»
13 years 4 months ago
Multistars, partial multistars and the capacitated vehicle routing problem
In an unpublished paper, Araque, Hall and Magnanti considered polyhedra associated with the Capacitated Vehicle Routing Problem (CVRP) in the special case of unit demands. Among th...
Adam N. Letchford, Richard W. Eglese, Jens Lysgaar...
MOR
2002
102views more  MOR 2002»
13 years 4 months ago
Facets of the Complementarity Knapsack Polytope
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...
Ismael R. de Farias Jr., Ellis L. Johnson, George ...
DAM
2000
137views more  DAM 2000»
13 years 4 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
MP
2006
79views more  MP 2006»
13 years 5 months ago
Projection results for vehicle routing
A variety of integer programming formulations have been proposed for Vehicle Routing Problems (VRPs), including the so-called two- and three-index formulations, the set partitioni...
Adam N. Letchford, Juan José Salazar Gonz&a...
MP
2006
100views more  MP 2006»
13 years 5 months ago
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated lot-sizing problem under uncertainty. We show that the classical ( , S) inequalit...
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser, ...
MP
2006
88views more  MP 2006»
13 years 5 months ago
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCorm...
MP
2006
77views more  MP 2006»
13 years 5 months ago
Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems
In this paper we introduce a new class of facet-inducing inequalities for the Windy Rural Postman Problem and the Windy General Routing Problem. These inequalities are called Zigz...
Angel Corberán, Isaac Plana, José M....