Lagrangian Relaxation and Enumeration for Solving Constrained Shortest-Path Problems

doi 10.21236/ada485742
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Defense Technical Information Center

Related search

A Quick Method for Judging the Feasibility of Security-Constrained Unit Commitment Problems Within Lagrangian Relaxation Framework

Energy and Power Engineering
2012English

I/O-Efficient Algorithms for Shortest Path Related Problems

English

An Analysis of Stochastic Shortest Path Problems

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
1991English

Approximate Algorithm for Searching Shortest Path in Multiservice Network With Constrained Resource

Prikladnaya diskretnaya matematika. Prilozhenie
2019English

Technical Note—Determining All Optimal and Near-Optimal Solutions When Solving Shortest Path Problems by Dynamic Programming

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1984English

A Nonlinear Lagrangian Approach to Constrained Optimization Problems

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2001English

An Automated Reference Point-Like Approach for Multicriteria Shortest Path Problems

Journal of Systems Science and Systems Engineering
ControlSystems EngineeringInformation Systems
2006English

Genetic Algorithm Based Technique for Solving Chance Constrained Problems

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2008English

Solving Ellipsoid-Constrained Integer Least Squares Problems

SIAM Journal on Matrix Analysis and Applications
Analysis
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy