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

Separation algorithm for tree partitioning inequalities

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

DOI10.1016/j.endm.2016.03.015zbMath1351.90042OpenAlexW2408256209MaRDI QIDQ325404

Kangbok Lee, Minseok Ryu, Sunil Chopra, Sang Ho Shim

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.015


zbMATH Keywords

integer programmingseparation algorithmtree partitioningvalid inequality


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10)




Cites Work

  • The partition problem
  • Efficient Algorithm for the Partitioning of Trees


This page was built for publication: Separation algorithm for tree partitioning inequalities

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:325404&oldid=12200899"
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 03:29.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki