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

Some constrained partitioning problems and majorization

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

DOI10.1016/S0377-2217(03)00256-XzbMath1067.90134OpenAlexW2145391557MaRDI QIDQ1876140

Geir Dahl, Truls Flatberg

Publication date: 16 August 2004

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00256-x


zbMATH Keywords

MatchingCombinatorial optimizationPartitioningMajorization


Mathematics Subject Classification ID

Combinatorial optimization (90C27)





Cites Work

  • Unnamed Item
  • Matching theory
  • The Complexity of Multiterminal Cuts
  • Inequalities: theory of majorization and its applications




This page was built for publication: Some constrained partitioning problems and majorization

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