Advanced search
Publication Cover
Journal of the Operational Research Society Volume 62, 2011 - Issue 4
Submit an article Journal homepage
39
Views
5
CrossRef citations to date
0
Altmetric
Theoretical Paper

On the usage of Lagrangean Relaxation for the convoy movement problem

P N Ram KumarNanyang Technological UniversitySingaporeCorrespondence[email protected]
&
T T NarendranIndian Institute of Technology MadrasChennaiIndia
Pages 722-728 | Received 01 Mar 2009, Accepted 01 Dec 2009, Published online: 21 Dec 2017

References

  • BazaraaMSGoodeJJThe traveling salesman problem: A duality approachMath Program19771322123710.1007/BF01584338
  • BazaraaMSGoodeJJA survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian dualityEur J Opl Res1979332233810.1016/0377-2217(79)90228-5
  • BeasleyJEA note on solving large p-median problemsEur J Opl Res19852127027310.1016/0377-2217(85)90040-2
  • BeasleyJEAn algorithm for set covering problemsEur J Opl Res198731859310.1016/0377-2217(87)90141-X
  • BeasleyJEAn algorithm for solving large capacitated warehouse location problemsEur J Opl Res19883331432510.1016/0377-2217(88)90175-0
  • BeasleyJEA Lagrangian heuristic for set covering problemsNav Res Log19903715116410.1002/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2
  • BeasleyJELagrangean heuristics for location problemsEur J Opl Res19936538339910.1016/0377-2217(93)90118-7
  • BeasleyJELagrangean relaxationModern Heuristic Techniques For Combinatorial Problems1993243305
  • BeasleyJEChristofidesNAn algorithm for the resource constrained shortest path problemNetworks19891937939410.1002/net.3230190402
  • ChardairePMcKeownGPHarrisonSARichardsonSBSolving a time-space network formulation for the convoy movement problemOpns Res20055321923010.1287/opre.1040.0183
  • ChristofidesNBeasleyJEExtensions to a Lagrangean relaxation approach for the capacitated warehouse location problemEur J Opl Res198312192810.1016/0377-2217(83)90179-0
  • DijkstraEWA note on two problems in connexion with graphsNumer Math1959126927110.1007/BF01386390
  • ErlenkotterDA dual-based procedure for uncapacitated facility locationOpns Res197826992100910.1287/opre.26.6.992
  • FisherMLOptimal solution of scheduling problems using Lagrange multipliers: Part IOpns Res1973211114112710.1287/opre.21.5.1114
  • FisherMLA dual algorithm for the one-machine scheduling problemMath Program19761122925110.1007/BF01580393
  • FisherMLThe Lagrangian relaxation method for solving integer programming problemsMngt Sci19812711810.1287/mnsc.27.1.1
  • FisherMLAn applications oriented guide to Lagrangian relaxationInterfaces1985152102110.1287/inte.15.2.10
  • FisherMLKediaPOptimal solution of set covering/partitioning problems using dual heuristicsMngt Sci19903667468810.1287/mnsc.36.6.674
  • FisherMLShapiroJFConstructive duality in integer programmingSIAM J Appl Math197427315210.1137/0127003
  • FisherMLNorthupWDShapiroJFUsing duality to solve discrete optimization problems: Theory and computational experienceMath Program197535694
  • FisherMLJaikumarRVan WassenhoveLA multiplier adjustment method for the generalized assignment problemMngt Sci1986321095110310.1287/mnsc.32.9.1095
  • GeoffrionAMLagrangian relaxation and its uses in integer programmingMath Program Stud197428211410.1007/BFb0120690
  • GeoffrionAMMcBridgeRLagrangian Relaxation applied to capacitated facility location problemsAIIE T197810404710.1080/05695557808975181
  • GoffinJLOn the convergence rates of subgradient optimization methodsMath Program19771332934710.1007/BF01584346
  • GuignardMRosenweinMBAn improved dual based algorithm for the generalized assignment problemOpns Res19893765866310.1287/opre.37.4.658
  • HeldMWolfePCrowderHDValidation of subgradient optimizationMath Program19746628810.1007/BF01580223
  • KohlNMadsenOBGAn optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxationOpns Res19974539540610.1287/opre.45.3.395
  • Ram KumarPNNarendranTTInteger programming formulation for convoy movement problemInt J Intell Defence Support Syst20081317718810.1504/IJIDSS.2008.023006
  • Ram KumarPNNarendranTTA mathematical approach for variable speed convoy movement problemDefense and Secu Analysis200925213715510.1080/14751790902985165
  • ShapiroJFGeneralized Lagrange multipliers in integer programmingOpns Res197119687610.1287/opre.19.1.68

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.