Sciweavers

1171 search results - page 64 / 235
» Variable neighborhood search
Sort
View
GI
2009
Springer
14 years 7 months ago
Coarse graining of an individual-based plant model
: The evolution and structuring of plant communities is governed by local plant-to-plant interaction. It has been shown that the individual variability of the organisms and the spa...
Johannes Hoefener, Lars Rudolf, Uta Berger, Thilo ...
ICTAI
2006
IEEE
15 years 3 months ago
Computing Horn Strong Backdoor Sets Thanks to Local Search
In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search technique...
Lionel Paris, Richard Ostrowski, Pierre Siegel, La...
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
15 years 4 months ago
Integer Programming: Optimization and Evaluation Are Equivalent
Abstract We show that if one can find the optimal value of an integer programming problem min{cx : Ax ≥ b, x ∈ Zn +} in polynomial time, then one can find an optimal solution...
James B. Orlin, Abraham P. Punnen, Andreas S. Schu...
AIPS
2008
15 years 1 days ago
A New Hybrid Genetic Algorithm for the Job Shop Scheduling Problem with Setup Times
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous...
Miguel A. González, Camino R. Vela, Ramiro ...
UAI
2008
14 years 11 months ago
Learning Inclusion-Optimal Chordal Graphs
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
Vincent Auvray, Louis Wehenkel