Sciweavers

2976 search results - page 115 / 596
» On the bounded integer programming
Sort
View
ALDT
2009
Springer
184views Algorithms» more  ALDT 2009»
15 years 7 months ago
Inverse Analysis from a Condorcet Robustness Denotation of Valued Outranking Relations
In this article we develop an indirect approach for assessing criteria significance weights from the robustness of the significance that a decision maker acknowledges for his pai...
Raymond Bisdorff, Patrick Meyer, Thomas Veneziano
IPCO
2008
136views Optimization» more  IPCO 2008»
15 years 4 months ago
Computing with Multi-row Gomory Cuts
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...
Daniel G. Espinoza
117
Voted
COR
2010
108views more  COR 2010»
15 years 2 months ago
GRASP and path relinking for the max-min diversity problem
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...
Mauricio G. C. Resende, Rafael Martí, Micae...
114
Voted
ANOR
2006
101views more  ANOR 2006»
15 years 2 months ago
Comparison of wavelength requirements between two wavelength assignment methods in survivable WDM networks
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...
Taehan Lee, Sungsoo Park
114
Voted
DAM
2006
172views more  DAM 2006»
15 years 2 months ago
A Branch-and-Cut algorithm for graph coloring
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...
Isabel Méndez-Díaz, Paula Zabala