Faster integer-feasibility in mixed-integer linear programs by branching to force change (Q632648): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MIPLIB2003 / rank
 
Normal rank
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.cor.2010.10.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068537726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP models and BB strategies in brachytherapy treatment optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scrap combination for steel production / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Improved Branch-and-Bound Method for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3372341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Octane: A New Heuristic for Pure 0–1 Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Active-constraint variable ordering for faster feasibility of mixed integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIPLIB 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Solutions of Knapsack Constraints / rank
 
Normal rank

Latest revision as of 21:28, 3 July 2024

scientific article
Language Label Description Also known as
English
Faster integer-feasibility in mixed-integer linear programs by branching to force change
scientific article

    Statements

    Identifiers