A simple finite cutting plane algorithm for integer programs (Q1939718): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2012.10.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037684433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Page cuts for integer interval linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finiteness proof for modified dantzig cuts in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outline of an algorithm for integer solutions to linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finitely converging cutting plane technique / rank
 
Normal rank

Latest revision as of 06:32, 6 July 2024

scientific article
Language Label Description Also known as
English
A simple finite cutting plane algorithm for integer programs
scientific article

    Statements

    Identifiers