Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LOQO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LogMIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FilMINT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CMU-IBM / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1918578756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic mixed-integer rounding cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / 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: Lift-and-project for mixed 0-1 programming: recent progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and Bound Methods for Mathematical Programming Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / 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: Experiments in mixed-integer linear programming / 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: Computational study of a family of mixed-integer quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in computational mixed integer programming -- a look back from the other side of the tipping point / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for convex mixed integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A feasibility pump for mixed integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Network Topological Optimization / 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: A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5493572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts for mixed 0-1 conic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and a hierarchy of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved strategies for branching on general disjunctions / 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: Exploring relaxation induced neighborhoods to improve MIP solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3394516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONOPT—A Large-Scale GRG Code / 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: Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / 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: Practical Solution of Large Mixed Integer Programming Problems with Umpire / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization / 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: Branch and Bound Experiments in Convex Nonlinear Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: There Cannot be any Algorithm for Integer Programming with Quadratic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex 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: Reformulations in mathematical programming: automatic symmetry detection and exploitation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3372341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Search Strategies for Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation and Mixed Integer Rounding to Solve MIPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting orbits in symmetric ILP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implicit Enumeration Algorithm for Quadratic Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINTO, a Mixed INTeger Optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbital branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / 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: LOQO:an interior point code for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank

Latest revision as of 11:26, 5 July 2024

scientific article
Language Label Description Also known as
English
Algorithms and Software for Convex Mixed Integer Nonlinear Programs
scientific article

    Statements

    Algorithms and Software for Convex Mixed Integer Nonlinear Programs (English)
    0 references
    0 references
    0 references
    0 references
    10 July 2012
    0 references
    0 references
    mixed integer nonlinear programming
    0 references
    branch and bound
    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
    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
    0 references
    0 references
    0 references