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

Generating Cutting Planes for Mixed Integer Programming Problems in a Parallel Computing Environment

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

DOI10.1287/ijoc.1030.0027zbMath1239.90079OpenAlexW2133125781MaRDI QIDQ2890402

Eva K. Lee

Publication date: 8 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1030.0027


zbMATH Keywords

parallelismmixed integer programmingcutting planes\texttt{MIPLIB}


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Parallel algorithms in computer science (68W10)


Related Items

A collaboratory for radiation therapy treatment planning optimization research


Uses Software

  • MIPLIB
  • DSDP5


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