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

From MaRDI portal
Publication:5387955

DOI10.1287/moor.1050.0166zbMath1278.90061OpenAlexW2103843819MaRDI QIDQ5387955

Jay Sethuraman, Lisa K. Fleischer

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




Related Items (21)

Parametric continuous-time linear fractional programming problemsApproximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming ProblemsInverse conic linear programs in Banach spacesNumerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functionsApproximate solutions and error bounds for a class of continuous-time linear programming problemsSolution algorithms for a class of continuous linear programs with fuzzy valued objective functionsA robust optimization formulation for dynamic pricing of a web service with limited total shared capacityUsing the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problemsUsing the parametric approach to solve the continuous-time linear fractional Max-min problemsOn solving continuous-time dynamic network flowsStochastic separated continuous conic programming: strong duality and a solution methodA simplex based algorithm to solve separated continuous linear programsRobust continuous linear programsAn asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespanApproximate solutions for continuous-time quadratic fractional programming problemsContinuous-time linear programming problems revisited: A perturbation approachA recurrence method for a special class of continuous time linear programming problemsDetermining strategy of pricing for a web service with different QoS levels and reservation level constraintTime-Varying Semidefinite ProgramsA simplex-type algorithm for continuous linear programs with constant coefficientsSolving Continuous-Time Linear Programming Problems Based on the Piecewise Continuous Functions




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