ReportDOI
Discrete Applied Mathematics
TLDR
Significant progress has been made with solution of location problems and in preprocessing and decomposition for discrete optimization and on the application of techniques from combinational optimization to nonlinear problems.Abstract:
: Significant progress has been made with solution of location problems and in preprocessing and decomposition for discrete optimization. There has also been research on the application of techniques from combinational optimization to nonlinear problems.read more
Citations
More filters
Book ChapterDOI
The maximum clique problem
TL;DR: A survey of results concerning algorithms, complexity, and applications of the maximum clique problem is presented and enumerative and exact algorithms, heuristics, and a variety of other proposed methods are discussed.
Journal ArticleDOI
Models, relaxations and exact approaches for the capacitated vehicle routing problem
Paolo Toth,Daniele Vigo +1 more
TL;DR: This paper reviews the exact algorithms based on the branch and bound approach proposed in the last years for the solution of the basic version of the vehicle routing problem (VRP), where only the vehicle capacity constraints are considered, and concludes by examining possible future directions of research in this field.
Journal ArticleDOI
Upper bounds to the clique width of graphs
Bruno Courcelle,Stephan Olariu +1 more
TL;DR: Clique width is bound in terms of its tree width on the one hand, and of the clique width of its edge complement on the other, to reduce the complexity measure of graphs associated with hierarchical decompositions.
Journal ArticleDOI
Modularity and community detection in bipartite networks.
TL;DR: The bipartite modularity is presented in terms of a modularity matrix B; some key properties of the eigenspectrum of B are identified and used to describe an algorithm for identifying modules in bipartites networks.
Journal ArticleDOI
A survey of very large-scale neighborhood search techniques
TL;DR: This paper surveys three broad classes of very large-scale neighborhood search (VLSN) algorithms: (1) variable-depth methods in which large neighbourhoods are searched heuristically, (2) large neighborhoods in which the neighborhoods are searched using network flow techniques or dynamic programming, and (3) large neighbourhoods induced by restrictions of the original problem that are solvable in polynomial time.
References
More filters
Book ChapterDOI
The maximum clique problem
TL;DR: A survey of results concerning algorithms, complexity, and applications of the maximum clique problem is presented and enumerative and exact algorithms, heuristics, and a variety of other proposed methods are discussed.
Journal ArticleDOI
Models, relaxations and exact approaches for the capacitated vehicle routing problem
Paolo Toth,Daniele Vigo +1 more
TL;DR: This paper reviews the exact algorithms based on the branch and bound approach proposed in the last years for the solution of the basic version of the vehicle routing problem (VRP), where only the vehicle capacity constraints are considered, and concludes by examining possible future directions of research in this field.
Journal ArticleDOI
Upper bounds to the clique width of graphs
Bruno Courcelle,Stephan Olariu +1 more
TL;DR: Clique width is bound in terms of its tree width on the one hand, and of the clique width of its edge complement on the other, to reduce the complexity measure of graphs associated with hierarchical decompositions.
Journal ArticleDOI
Modularity and community detection in bipartite networks.
TL;DR: The bipartite modularity is presented in terms of a modularity matrix B; some key properties of the eigenspectrum of B are identified and used to describe an algorithm for identifying modules in bipartites networks.
Journal ArticleDOI
A survey of very large-scale neighborhood search techniques
TL;DR: This paper surveys three broad classes of very large-scale neighborhood search (VLSN) algorithms: (1) variable-depth methods in which large neighbourhoods are searched heuristically, (2) large neighborhoods in which the neighborhoods are searched using network flow techniques or dynamic programming, and (3) large neighbourhoods induced by restrictions of the original problem that are solvable in polynomial time.