Nonconvex, lower semicontinuous piecewise linear optimization (Q951120): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2007.07.001 / rank
Normal rank
 
Property / author
 
Property / author: Ahmet Burak Keha / rank
Normal rank
 
Property / author
 
Property / author: Nemhauser, George I. / rank
Normal rank
 
Property / author
 
Property / author: Ahmet Burak Keha / rank
 
Normal rank
Property / author
 
Property / author: Nemhauser, George I. / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / 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.1016/j.disopt.2007.07.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074519331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling piecewise linear concave costs in a tree partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A composite algorithm for a concave-cost network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring relaxation induced neighborhoods to improve MIP solutions / 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: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs / 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: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem / 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: On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and separation for capacitated fixed charge flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and separation for uncapacitated fixed charge networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for mixed 0-1 programs / 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: Submodularity and valid inequalities in capacitated fixed charge networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations for mixed integer programming: A survey / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2007.07.001 / rank
 
Normal rank

Latest revision as of 09:37, 10 December 2024

scientific article
Language Label Description Also known as
English
Nonconvex, lower semicontinuous piecewise linear optimization
scientific article

    Statements

    Nonconvex, lower semicontinuous piecewise linear optimization (English)
    0 references
    0 references
    0 references
    0 references
    29 October 2008
    0 references
    discontinuous piecewise linear functions
    0 references
    branch-and-cut
    0 references
    0 references

    Identifiers