A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
DOI10.1016/J.EJOR.2006.07.031zbMATH Open1128.90009OpenAlexW1971581721MaRDI QIDQ879323FDOQ879323
Authors: Osman Oguz, Iradj Ouveysi, Tolga Bektaş
Publication date: 11 May 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/23371
Recommendations
- scientific article; zbMATH DE number 2156296
- Lagrangean decomposition/relaxation for the routing and wavelength assignment problem
- Solving the Multi-Depot Location-Routing Problem with Lagrangian Relaxation
- Exact algorithms for the joint object placement and request routing problem in content distribution networks
- scientific article; zbMATH DE number 3912132
- An augmented Lagrangian algorithm for large scale multicommodity routing
- Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding
- scientific article; zbMATH DE number 4085396
- A Lagrangian Relaxation Algorithm For A Production Planning Problem Where Products Have Alternate Routings
Deterministic network models in operations research (90B10) Decomposition methods (49M27) Traffic problems in operations research (90B20)
Cites Work
Cited In (3)
This page was built for publication: A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879323)