Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q396479
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Sang Bum Lee / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LogMIP / 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/s10479-005-3451-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049847730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Additive Algorithm for Solving Linear Programs with Zero-One Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for disjunctive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved branch and bound algorithm for mixed integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programming for disjunctive convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree-search algorithm for mixed integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving mixed integer nonlinear programs by outer approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / 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: Review of nonlinear mixed-integer and disjunctive programming techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized convex disjunctive programming: Nonlinear convex hull relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and Bound Experiments in Convex Nonlinear Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3489527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed logical-linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889854 / 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: Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating SQP and branch-and-bound for mixed integer nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for linear fractional and bilinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of relaxations for linear generalized disjunctive programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut method for 0-1 mixed convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms / rank
 
Normal rank

Latest revision as of 10:46, 24 June 2024

scientific article
Language Label Description Also known as
English
Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
scientific article

    Statements

    Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (English)
    0 references
    0 references
    0 references
    7 March 2006
    0 references
    mixed-integer programming
    0 references
    generalized disjunctive programming
    0 references
    global optimization
    0 references
    logic-based programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers