Variable neighbourhood search: methods and applications
Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
[BOK][B] The linear ordering problem: exact and heuristic methods in combinatorial optimization
Complex optimization problems abound in the real world. In the face of these challenges,
established methods often fall short of providing solutions. However,'exact'and …
established methods often fall short of providing solutions. However,'exact'and …
A benchmark library and a comparison of heuristic methods for the linear ordering problem
The linear ordering problem consists of finding an acyclic tournament in a complete
weighted digraph of maximum weight. It is one of the classical NP-hard combinatorial …
weighted digraph of maximum weight. It is one of the classical NP-hard combinatorial …
Variable neighbourhood search: methods and applications
Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
Exact and heuristic methods in combinatorial optimization
Faced with the challenge of solving hard optimization problems that abound in the real
world, classical methods often encounter serious difficulties. Important applications in …
world, classical methods often encounter serious difficulties. Important applications in …
[HTML][HTML] Learning variable neighborhood search for a scheduling problem with time windows and rejections
Variable neighborhood search is a local search metaheuristic that uses sequentially
different neighborhood structures. This method has been successfully applied to various …
different neighborhood structures. This method has been successfully applied to various …
An updated survey on the linear ordering problem for weighted or unweighted tournaments
I Charon, O Hudry - Annals of Operations Research, 2010 - Springer
In this paper, we survey some results, conjectures and open problems dealing with the
combinatorial and algorithmic aspects of the linear ordering problem. This problem consists …
combinatorial and algorithmic aspects of the linear ordering problem. This problem consists …
The linear ordering problem revisited
Abstract The Linear Ordering Problem is a popular combinatorial optimisation problem
which has been extensively addressed in the literature. However, in spite of its popularity …
which has been extensively addressed in the literature. However, in spite of its popularity …
Variable neighborhood search with memory for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times
In this paper we study the problem of sequencing jobs in a single machine with programmed
preventive maintenance and sequence-dependent set-up times. This is an NP-hard problem …
preventive maintenance and sequence-dependent set-up times. This is an NP-hard problem …
Cumulative capacitated colored traveling salesman problem
A colored traveling salesman problem (CTSP) is a generalization of the well-known multiple
traveling salesman problem, which introduces colors to distinguish the accessibility of its …
traveling salesman problem, which introduces colors to distinguish the accessibility of its …