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

Solving 0-1 Minimax Problems

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

DOI10.2307/2582765zbMath0617.90066OpenAlexW4253536332MaRDI QIDQ3754438

No author found.

Publication date: 1987

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2582765


zbMATH Keywords

minisum problemminimax 0-1 programming


Mathematics Subject Classification ID

Linear programming (90C05) Boolean programming (90C09)


Related Items (2)

Generalized multiple objective bottleneck problems ⋮ An efficient heuristic algorithm for the bottleneck traveling salesman problem




This page was built for publication: Solving 0-1 Minimax Problems

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