Combinatorial heuristic algorithms with FORTRAN

MaRDI QIDQ1094328zbMATH OpenFDO

Authors Hang Lau

Publication date 1986

Published in Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)

zbMATH Keywords

heuristicsapproximation algorithmSteiner treetravelling salesmanzero-one knapsackK- median locationK-center

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Integer programming (90C10) Inventory, storage, reservoirs (90B05) Boolean programming (90C09)

Recommendations

• scientific article; zbMATH DE number 41051
• Algorithm 797
• scientific article; zbMATH DE number 3918092
• scientific article; zbMATH DE number 1270545
• scientific article; zbMATH DE number 4064777

Cited in

(3)

• scientific article; zbMATH DE number 3910135 (Why is no real title available?)
• Steiner's problem in graphs: Heuristic methods
• An algorithm of internal feasible directions for linear integer programming

This page was built for publication: Combinatorial heuristic algorithms with FORTRAN

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