Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Combinatorial heuristic algorithms with FORTRAN

From MaRDI portal
Publication:1094328
Jump to:navigation, search

zbMath0629.90055MaRDI QIDQ1094328

H. T. Lau

Publication date: 1986

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


zbMATH Keywords

heuristicsapproximation algorithmtravelling salesmanSteiner treezero-one knapsackK- median locationK-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

Steiner's problem in graphs: Heuristic methods, An algorithm of internal feasible directions for linear integer programming



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1094328&oldid=13125279"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 02:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki