Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints (Q1947201): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Significance of Solving Linear Programming Problems with Some Integer Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized assignment problem with special ordered sets: a polyhedral approach. / 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: Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints / 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: A special ordered set approach for optimizing a discontinuous separable piecewise linear function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models for representing piecewise linear cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Solution of Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer models for the stationary case of gas network optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Portfolio Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints / rank
 
Normal rank

Latest revision as of 09:18, 6 July 2024

scientific article
Language Label Description Also known as
English
Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
scientific article

    Statements

    Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints (English)
    0 references
    0 references
    12 April 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    piecewise linear optimization
    0 references
    mixed-integer programming
    0 references
    knapsack problem
    0 references
    special ordered set
    0 references
    semi-continuous variable
    0 references
    polyhedral method
    0 references
    branch-and-cut
    0 references
    90
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references