Combinatorial heuristic algorithms with FORTRAN

From MaRDI portal

Revision as of 01:23, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1094328

Jump to:navigation, search

zbMath0629.90055MaRDI QIDQ1094328

Publication date: 1986

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

zbMATH Keywords

heuristics approximation algorithm travelling salesman Steiner tree zero-one knapsack K- median location K-center

Mathematics Subject Classification ID

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

Related Items (2)

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1094328&oldid=13125279"