\texttt{lsmear}: a variable selection strategy for interval branch and bound solvers (Q721162): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SoPlex / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: INTBIS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: IbexOpt / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ICOS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ANTIGONE / 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.1007/s10898-017-0569-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2754226237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdivision Direction Selection in Interval Methods for Global Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractor programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 681: INTBIS, a portable interval Newton/bisection package / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal multisections in interval branch-and-bound methods of global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive Interval Disjunction / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient and safe framework for solving optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4855524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: ICOS: a branch and bound based solver for rigorous global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reliable affine relaxation method for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounding in inner regions for global optimization under inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node selection strategies in interval branch and bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of AI and OR techniques in contraint programming for combinatorial optimzation problems. 9th international conference, CPAIOR 2012, Nantes, France, May 28--June 1, 2012. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations / rank
 
Normal rank

Latest revision as of 03:35, 16 July 2024

scientific article
Language Label Description Also known as
English
\texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
scientific article

    Statements

    \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers (English)
    0 references
    0 references
    0 references
    18 July 2018
    0 references
    branch and bound
    0 references
    interval-based solver
    0 references
    variable selection
    0 references
    Lagrangian multipliers
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers