Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions

DOI10.1287/MOOR.1050.0166MaRDI QIDQ5387955zbMATH OpenOpenAlexFDO

Authors Lisa Fleischer, Jay Sethuraman

Publication date 27 May 2008

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/d8e1d0001b0f8e383c4ea876bae93159272deac7

zbMATH Keywords

approximation schemecontinuous linear programsmulticlass queueing networksmulticommodity flowoptimal control

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 2079321
• Polynomial approximations for continuous linear programs
• An extended algorithm for separated continuous linear programs
• An adaptive discretization algorithm for a class of continuous network programs
• Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time

Cited in

(24)

• Stochastic separated continuous conic programming: strong duality and a solution method
• Solution algorithms for a class of continuous linear programs with fuzzy valued objective functions
• Determining strategy of pricing for a web service with different QoS levels and reservation level constraint
• Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions
• Robust continuous linear programs
• A simplex-type algorithm for continuous linear programs with constant coefficients
• Parametric continuous-time linear fractional programming problems
• Solving continuous-time linear programming problems based on the piecewise continuous functions
• Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems
• Polynomial approximations for continuous linear programs
• Approximate solutions and error bounds for a class of continuous-time linear programming problems
• Using the parametric approach to solve the continuous-time linear fractional Max-min problems
• scientific article; zbMATH DE number 2079321 (Why is no real title available?)
• On solving continuous-time dynamic network flows
• Review on the research for separated continuous linear programming: with applications on service operations
• Continuous-time linear programming problems revisited: a perturbation approach
• Time-Varying Semidefinite Programs
• An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan
• Approximate solutions for continuous-time quadratic fractional programming problems
• A robust optimization formulation for dynamic pricing of a web service with limited total shared capacity
• Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
• Inverse conic linear programs in Banach spaces
• A simplex based algorithm to solve separated continuous linear programs
• A recurrence method for a special class of continuous time linear programming problems

This page was built for publication: Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387955)