A conic quadratic formulation for a class of convex congestion functions in network flow problems (Q713098): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2010.12.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2126984548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong conic quadratic reformulation for machine-job assignment with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic mixed-integer rounding cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting for conic mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected Perspective Reformulations with Applications in Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspective reformulations of mixed integer nonlinear programs with indicator variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for global optimization of capacity expansion and flow assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local optimality conditions for multicommodity flow problems with separable piecewise convex costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity and flow assignment of data networks by generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Algorithms for Convex Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP with path-relinking for private virtual circuit routing / rank
 
Normal rank

Latest revision as of 20:05, 5 July 2024

scientific article
Language Label Description Also known as
English
A conic quadratic formulation for a class of convex congestion functions in network flow problems
scientific article

    Statements

    A conic quadratic formulation for a class of convex congestion functions in network flow problems (English)
    0 references
    0 references
    26 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    integer programming
    0 references
    network flows
    0 references
    second-order cone programming
    0 references
    capacity expansion
    0 references
    congestion costs
    0 references
    convex increasing power functions
    0 references
    0 references