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
Discussion
View source
View history
Purge
English
Log in

Linear programming formulation of the set partitioning problem

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

DOI10.1504/IJOR.2010.034067zbMath1205.90244OpenAlexW2105554874MaRDI QIDQ604761

Moustapha Diaby

Publication date: 12 November 2010

Published in: International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijor.2010.034067


zbMATH Keywords

computational complexitytransportation problemreformulationpath-based modelling


Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27)


Related Items (1)

OPTIMAL SET-PARTITIONING BASED ON GROUP QUALITY LIKELIHOOD USING PARTITION-GROWING ALGORITHM







This page was built for publication: Linear programming formulation of the set partitioning problem

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