A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem

DOI10.1287/OPRE.42.4.677zbMath0815.90134OpenAlexW2081725015MaRDI QIDQ4319757

Thomas A. Feo, Manuel Laguna, Hal C. Elrod

Publication date: 12 January 1995

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.42.4.677

zbMATH Keywords

heuristicgreedy randomized adaptive search proceduregeneral purpose mixed integer programmingnetwork 2-partition problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11)

Related Items (10)

A multi-objective model for environmental investment decision making ⋮ 3D geo-graphs: efficient flip verification for the spherical zoning problem ⋮ Case-based reasoning and improved adaptive search for project scheduling ⋮ Greedy randomized adaptive search procedures ⋮ Heuristics and meta-heuristics for 2-layer straight line crossing minimization ⋮ Distribution requirements and compactness constraints in school timetabling ⋮ A GRASP heuristic for the mixed Chinese postman problem ⋮ Solution of large weighted equicut problems ⋮ A tabu search approach to the constraint satisfaction problem as a general problem solver ⋮ ``Miniaturized linearizations for quadratic 0/1 problems

This page was built for publication: A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem