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

The integral basis method for integer programming

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

DOI10.1007/s001860100124zbMath1031.90015OpenAlexW2011943258MaRDI QIDQ1396977

Matthias Köppe, Robert Weismantel, Utz-Uwe Haus

Publication date: 15 July 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860100124

zbMATH Keywords

integer programmingHilbert basesprimal methods


Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)


Related Items

Improved integral simplex using decomposition for the set partitioning problem, A class of integer linear fractional bilevel programming problems, Non-standard approaches to integer programming, Integral simplex using double decomposition for set partitioning problems, Improving set partitioning problem solutions by zooming around an improving direction, Integral Simplex Using Decomposition for the Set Partitioning Problem


Uses Software

  • MIPLIB


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