A feasible rounding approach for mixed-integer optimization problems (Q2419508): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q129076147, #quickstatements; #temporary_batch_1724739681498
(3 intermediate revisions by 3 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.1007/s10589-018-0042-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2899062086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presolve Reductions in Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIPLIB 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Rounding for Polymatroid and Branching Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A feasibility pump heuristic for general mixed-integer problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: RENS. The optimal rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undercover: a primal MINLP heuristic exploring a largest sub-MIP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting the feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for convex mixed integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility pump 2.0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Heuristic Procedures for Integer Linear Programming with an Interior / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding-based heuristics for nonconvex MINLPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Granularity in nonlinear mixed-integer optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds for mixed integer linear optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds for mixed integer nonlinear optimization problems / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129076147 / rank
 
Normal rank

Revision as of 07:35, 27 August 2024

scientific article
Language Label Description Also known as
English
A feasible rounding approach for mixed-integer optimization problems
scientific article

    Statements

    A feasible rounding approach for mixed-integer optimization problems (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2019
    0 references
    rounding
    0 references
    granularity
    0 references
    inner parallel set
    0 references
    consistency
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers