A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q127201335, #quickstatements; #temporary_batch_1722426648791
 
(8 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SCIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BARON / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: KNITRO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Mosek / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Bonmin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2975229626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pooling Problem: Alternate Formulations and Solution Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming / 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: Computational study of a family of mixed-integer quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outer-product-free sets for polynomial optimization and oracle-based cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized bilinear programming: An application in farm management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5493572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensional Packing by Bilinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Inequalities for the Pooling Problem with Binary Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of MILP Techniques for the Pooling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching on nonchimerical fractionalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Erraticism in Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bilinear approach to the pooling problem† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral convexity cuts and negative edge extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved convexity cuts for lattice point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Mixed Integer Bilinear Problems Using MILP Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations and discretizations for the pooling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-based branching schemes for binary linear mixed integer problems / 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: Q3677502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5306655 / 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: BARON: A general purpose global optimization software package / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new reformulation-linearization technique for bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong valid inequalities for orthogonal disjunctions and bilinear covering sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework / 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 / Wikidata QID
 
Property / Wikidata QID: Q127201335 / rank
 
Normal rank

Latest revision as of 12:54, 31 July 2024

scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for mixed-integer bilinear programming
scientific article

    Statements

    A branch-and-cut algorithm for mixed-integer bilinear programming (English)
    0 references
    0 references
    0 references
    8 January 2020
    0 references
    combinatorial optimization
    0 references
    mixed-integer quadratic programming
    0 references
    bilinear programming
    0 references
    branch-and-cut algorithms
    0 references
    intersection cuts
    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