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

The combinatorial complexity of masterkeying

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

DOI10.1007/S001860000084zbMath1032.90082OpenAlexW2087355792MaRDI QIDQ1397694

W. Espelage, Egon Wanke

Publication date: 7 August 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860000084



Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60)








This page was built for publication: The combinatorial complexity of masterkeying

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