Sciweavers

147 search results - page 6 / 30
» Alternative techniques to solve hard multi-objective optimiz...
Sort
View
EOR
2006
134views more  EOR 2006»
13 years 7 months ago
A smoothing heuristic for a bilevel pricing problem
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm...
Jean-Pierre Dussault, Patrice Marcotte, Séb...
JAIR
2008
120views more  JAIR 2008»
13 years 7 months ago
MiniMaxSAT: An Efficient Weighted Max-SAT solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that is built on top of MINISAT+. It incorporates the best current SAT and Max-SAT techniques. It can handle hard claus...
Federico Heras, Javier Larrosa, Albert Oliveras
SARA
2009
Springer
14 years 1 months ago
Some Interval Approximation Techniques for MINLP
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
Nicolas Berger, Laurent Granvilliers
WABI
2005
Springer
109views Bioinformatics» more  WABI 2005»
14 years 25 days ago
Optimal Protein Threading by Cost-Splitting
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...
Philippe Veber, Nicola Yanev, Rumen Andonov, Vince...
CEC
2010
IEEE
12 years 11 months ago
A hybrid genetic algorithm for rescue path planning in uncertain adversarial environment
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
Jean Berger, Khaled Jabeur, Abdeslem Boukhtouta, A...