Sciweavers

2636 search results - page 129 / 528
» Linear Programming
Sort
View
SAINT
2008
IEEE
15 years 4 months ago
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem
We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...
Markus Leitner, Günther R. Raidl
ALDT
2009
Springer
184views Algorithms» more  ALDT 2009»
15 years 2 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
ESANN
2004
14 years 11 months ago
Fuzzy LP-SVMs for Multiclass Problems
Abstract. In this paper, we propose fuzzy linear programming support vector machines (LP-SVMs) that resolve unclassifiable regions for multiclass problems. Namely, in the direction...
Shigeo Abe
IPCO
2001
117views Optimization» more  IPCO 2001»
14 years 11 months ago
Pruning by Isomorphism in Branch-and-Cut
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
François Margot
COR
2010
108views more  COR 2010»
14 years 10 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...