On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CLP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CUTGEN1 / 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/s00186-020-00723-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3044591839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Cuts for Mixed Integer Conic Quadratic Sets / 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: Disjunctive programming: Properties of the convex hull of feasible points / 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: Disjunctive Cuts for Nonconvex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lift-and-Project Cuts for Mixed Integer Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the separation of split cuts and related inequalities / 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: Chvátal closures for mixed integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for mixed integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The split closure of a strictly convex body / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the split rank of intersection cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split Rank of Triangle and Quadrilateral Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: New SOCP relaxation and branching rule for bipartite bilinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some polyhedra related to combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different transformations for solving non-convex trim-loss problems by MINLP / 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: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lift-and-project cuts for convex mixed integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Quadratic Quasi-polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split cuts and extended formulations for mixed integer conic quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection cuts for nonlinear integer programming: convexification techniques for structured sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive procedure to generate all cuts for 0-1 mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A disjunctive cutting plane procedure for general mixed-integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of a mixed-integer bilinear covering set with bounds on variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs / 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: Strong valid inequalities for orthogonal disjunctions and bilinear covering sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional cutting stock problem to minimize the number of different patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:48, 24 July 2024

scientific article
Language Label Description Also known as
English
On the facet defining inequalities of the mixed-integer bilinear covering set
scientific article

    Statements

    On the facet defining inequalities of the mixed-integer bilinear covering set (English)
    0 references
    0 references
    15 December 2020
    0 references
    0 references
    mixed-integer programming
    0 references
    global optimization
    0 references
    convex hull
    0 references
    disjunctive cut
    0 references
    split cut
    0 references
    split-rank
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references