scientific article; zbMATH DE number 1488101

MaRDI QIDQ4495207zbMATH OpenFDO

Authors David L. Woodruff

Publication date 10 August 2000

zbMATH Keywords

branch and bound algorithmsmeta-heuristicsreactive tabu search

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Hybridizations of metaheuristics with branch \& bound derivates
• scientific article; zbMATH DE number 2209661
• A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
• A proposal for a hybrid meta-strategy for combinatorial optimization problems
• A general meta-heuristic based solver for combinatorial optimisation problems
• A branch and bound algorithm for Choquet optimization in multicriteria problems
• scientific article; zbMATH DE number 3845070
• Hybridizing exact methods and metaheuristics: a taxonomy
• Combining metaheuristics with mathematical programming, constraint programming and machine learning

Cited in

(6)

• Chunking and cooperation in particle swarm optimization for feature selection
• Integrating pivot based search with branch and bound for binary MIPs
• Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
• Hybridizations of metaheuristics with branch \& bound derivates
• A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems
• Improving metaheuristics convergence properties in inductive query by example using two strategies for reducing the search space

Describes a project that uses

Uses Software

• XPRESS

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4495207)