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

DOI10.1057/PALGRAVE.JORS.2601391MaRDI QIDQ4656733zbMATH OpenOpenAlexFDO

Authors

Publication date 14 March 2005

Published in The 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

facility layoutgreedy adaptive random search procedureheuristicsinteger programming formulationmaximal planar graphmeta-heuristicsmodels

Mathematics Subject Classification ID

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

Recommendations

• Efficient facility layout planning in a maximally planar graph model
• scientific article; zbMATH DE number 1206315
• A New Graph-Theoretic Heuristic for Facility Layout
• A GRASP for graph planarization
• scientific article; zbMATH DE number 910888

Cited in

(5)

• Hybridizing exact methods and metaheuristics: a taxonomy
• Weighted vertices optimizer (WVO): a novel metaheuristic optimization algorithm
• A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
• scientific article; zbMATH DE number 1206315 (Why is no real title available?)
• Local Search Algorithms for the Maximal Planar Layout Problem

Describes a project that uses

Uses Software

• GRASP
• Algorithm 797

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

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