On cutting planes for cardinality-constrained linear programs (Q2330656): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the \(p\)-median polytope / 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: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on solving large p-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An evolutionary heuristic for the index tracking problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best subset selection via a modern optimization lens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for cardinality-constrained quadratic optimization / 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: Q4747150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for cardinality constrained portfolio optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree search algorithm for the p-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing for complex portfolio selection problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Direct Formulation for Sparse PCA Using Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An MCDM approach to portfolio optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of facets for the uncapacitated \(p\)-median polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut for combinatorial optimization problems without auxiliary binary variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study of the cardinality constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4459806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity Cuts and Cut Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some polyhedra related to combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—The Use of Cuts in Complementary Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Branch-and-Bound Algorithm for Seeking the <i>P</i>-Median / 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: Generalized power method for sparse principal component analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lift-and-project for general two-term disjunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the portfolio selection problem with minimum transaction lots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Algorithm for the <i>p</i>-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4235027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid optimization approach to index tracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank

Revision as of 19:08, 20 July 2024

scientific article
Language Label Description Also known as
English
On cutting planes for cardinality-constrained linear programs
scientific article

    Statements

    On cutting planes for cardinality-constrained linear programs (English)
    0 references
    0 references
    0 references
    22 October 2019
    0 references
    complementarity/cardinality constraints
    0 references
    disjunctive sets
    0 references
    tableau cuts
    0 references
    equate-and-relax procedure
    0 references
    concavity cuts
    0 references
    Prim's algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references