Guided dive for the spatial branch-and-bound (Q1675571): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(6 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-017-0503-3 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: ANTIGONE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LINDO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LINDOGlobal / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2590825195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of convex relaxations using automated code generation techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching and bounds tighteningtechniques for non-convex MINLP / 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: Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Nonlinear Programming Algorithms for Chemical Process Control and Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Trust Region Algorithm for Nonlinearly Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The global solver in the LINDO API / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring relaxation induced neighborhoods to improve MIP solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advanced techniques for clearance of flight control laws / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear programming without a penalty function. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial and Continuous Models for the Optimization of Traffic Flows on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem with neighbourhoods: MINLP solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding-based heuristics for nonconvex MINLPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recipe for finding good solutions to MINLPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete search in continuous global optimization and constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of nominations in gas network optimization: models, methods, and solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-017-0503-3 / rank
 
Normal rank

Latest revision as of 05:30, 28 December 2024

scientific article
Language Label Description Also known as
English
Guided dive for the spatial branch-and-bound
scientific article

    Statements

    Guided dive for the spatial branch-and-bound (English)
    0 references
    2 November 2017
    0 references
    spatial branch-and-bound
    0 references
    local search
    0 references
    heuristic
    0 references
    guided dive
    0 references
    branching
    0 references
    Couenne
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers