1707 search results - page 71 / 342 » Early Integer Programming |
150
Voted
IPCO
2008
15 years 3 months ago
2008
Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to GMI cu...
113
click to vote
COR
2010
15 years 2 months ago
2010
The Max-Min Diversity Problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The prob...
111
click to vote
ANOR
2006
15 years 2 months ago
2006
We consider the routing and wavelength assignment (RWA) in survivable WDM network. A path protection scheme assumed and two different wavelength assignment methods for protection p...
112
click to vote
DAM
2006
15 years 2 months ago
2006
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
148
Voted
JAL
2008
15 years 2 months ago
2008
Mixed Multi-Unit Combinatorial Auctions extend and generalize all the preceding types of combinatorial auctions. In this paper, we try to make headway on the practical application...