相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Variable neighborhood search: basics and variants
Pierre Hansen et al.
EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION (2017)
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
Claudio Fabiano Motta Toledo et al.
JOURNAL OF HEURISTICS (2015)
Proximity search for 0-1 mixed-integer convex programming
Matteo Fischetti et al.
JOURNAL OF HEURISTICS (2014)
Hub location problems: A review of models, classification, solution techniques, and applications
Reza Zanjirani Farahani et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2013)
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis
Thibaut Vidal et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2013)
Restrict-and-relax search for 0-1 mixed-integer programs
Menal Guzelsoy et al.
EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION (2013)
Improved convergent heuristics for the 0-1 multidimensional knapsack problem
Said Hanafi et al.
ANNALS OF OPERATIONS RESEARCH (2011)
A computational study of parametric tabu search for 0-1 mixed integer programs
Luis Henrique Sacchi et al.
COMPUTERS & OPERATIONS RESEARCH (2011)
Traveling salesman problem heuristics: Leading methods, implementations and latest advances
Cesar Rego et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2011)
A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations
Lars Moench et al.
JOURNAL OF SCHEDULING (2011)
Variable neighbourhood decomposition search for 0-1 mixed integer programs
Jasmina Lazic et al.
COMPUTERS & OPERATIONS RESEARCH (2010)
Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization - Part II: Exploiting Reaction and Resistance
Fred Glover et al.
INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING (2010)
New convergent heuristics for 0-1 mixed integer programming
Christophe Wilbaut et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2009)
An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
Christophe Wilbaut et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2009)
SCIP: solving constraint integer programs
Tobias Achterberg
MATHEMATICAL PROGRAMMING COMPUTATION (2009)
Repairing MIP infeasibility through local branching
Matteo Fischetti et al.
COMPUTERS & OPERATIONS RESEARCH (2008)
Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming
Jonathan Eckstein et al.
JOURNAL OF HEURISTICS (2007)
Improving the feasibility pump
Tobias Achterberg et al.
DISCRETE OPTIMIZATION (2007)
A feasibility pump heuristic for general mixed-integer problems
Livio Bertacco et al.
DISCRETE OPTIMIZATION (2007)
A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
Akio Imai et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
Franklina Maria Bragion Toledo et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2006)
Variable neighborhood search and local branching
P Hansen et al.
COMPUTERS & OPERATIONS RESEARCH (2006)
Parametric tabu-search for mixed integer programs
F Glover
COMPUTERS & OPERATIONS RESEARCH (2006)
The feasibility pump
M Fischetti et al.
MATHEMATICAL PROGRAMMING (2005)
Exploring relaxation induced neighborhoods to improve MIP solutions
E Danna et al.
MATHEMATICAL PROGRAMMING (2005)
Local branching
M Fischetti et al.
MATHEMATICAL PROGRAMMING (2003)
Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows
H Stadtler
OPERATIONS RESEARCH (2003)
Octane: A new heuristic for pure 0-1 programs
E Balas et al.
OPERATIONS RESEARCH (2001)
bc-prod:: A specialized branch-and-cut system for lot-sizing problems
G Belvaux et al.
MANAGEMENT SCIENCE (2000)
A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem
K Holmberg et al.
OPERATIONS RESEARCH (2000)
分享论文
