Linear programming based meta-heuristics for the weighted maximal planar graph

DOI10.1057/PALGRAVE.JORS.2601391zbMath1139.90426OpenAlexW2057105105MaRDI QIDQ4656733

No author found.

Publication date: 14 March 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601391

zbMATH Keywords

heuristicsmodelsmeta-heuristicsfacility layoutmaximal planar graphinteger programming formulationgreedy adaptive random search procedure

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05)

Related Items (2)

A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem ⋮ Hybridizing exact methods and metaheuristics: a taxonomy

Uses Software

• Unnamed Item
• Algorithm 797

This page was built for publication: Linear programming based meta-heuristics for the weighted maximal planar graph