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

scientific article

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

zbMath0968.90523MaRDI QIDQ2743982

Gang Yu, Panagiotis Kouvelis

Publication date: 18 September 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)


Related Items (5)

Relocation problems arising in conservation biology ⋮ Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion ⋮ Risk-averse single machine scheduling: complexity and approximation ⋮ Min-max optimization of several classical discrete optimization problems ⋮ A genetic algorithm of determining cycle time for printed circuit board assembly lines




This page was built for publication:

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