Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets (Q2248758): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 4 users not shown)
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: PORTA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LINGO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LINDO / 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/s10107-013-0652-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979024972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow pack facets of the single node fixed-charge flow polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facets of the mixed-integer knapsack polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / 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 new linearization technique for multi-quadratic 0-1 programming problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Linear Inequalities for Fixed Charge 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: Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Separable Nonconvex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence independent lifting in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet of regular 0–1 polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 0-1 knapsack problem with a single continuous variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilinear modeling solution approach for fixed charge network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting inequalities: a framework for generating strong cuts for nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved linearization strategy for zero-one quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3528714 / 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: Faces for a linear inequality in 0–1 variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Facets and Strong Valid Inequalities for Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Inequalities and Superadditivity for 0–1 Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Integer Knapsack Cover Polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:12, 8 July 2024

scientific article
Language Label Description Also known as
English
Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
scientific article

    Statements

    Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets (English)
    0 references
    0 references
    0 references
    27 June 2014
    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