Sciweavers

1984 search results - page 50 / 397
» The colourful feasibility problem
Sort
View
MP
2008
137views more  MP 2008»
15 years 5 months ago
Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints
Stochastic dominance relations are well-studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into...
Nilay Noyan, Andrzej Ruszczynski
LATIN
2010
Springer
15 years 4 months ago
The Interval Constrained 3-Coloring Problem
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...
Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanit&a...
DAC
1994
ACM
15 years 9 months ago
Chain Closure: A Problem in Molecular CAD
Conformational analysis is the problem of nding all minimal energy three-dimensional con gurations of molecules. Cyclic structures are of particular interest. An ecient algorithm...
Maria Domenica Di Benedetto, Pasquale Lucibello, A...
CEC
2010
IEEE
15 years 6 months ago
Multiobjective optimization algorithm for solving constrained single objective problems
Abstract--In this paper, the results for the CEC 2010 Competition and Special Session on Constrained Real-Parameter Optimization using the multiobjective differential evolution alg...
Gilberto Reynoso-Meza, Xavier Blasco Ferragud, Jav...
COR
2008
99views more  COR 2008»
15 years 5 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi