Distance confined path problem and separable integer programming

DOI10.1080/02331934.2012.660484zbMath1273.90126OpenAlexW2084401125WikidataQ57445436 ScholiaQ57445436MaRDI QIDQ2841138

No author found.

Publication date: 24 July 2013

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2012.660484

zbMATH Keywords

dynamic programminggraph reductionseparable integer programming\(k\)th shortest path problemsurrogate constraint formulation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30) Boolean programming (90C09)

Cites Work

• Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems
• Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
• A nonlinear knapsack problem
• Solving the \(k\)-shortest path problem with time windows in a time varying network
• Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation
• Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming
• Surrogate Dual Multiplier Search Procedures in Integer Programming
• Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function
• Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• An efficient algorithm for K shortest simple paths
• Constructive Duality in Integer Programming
• A Convergent Duality Theory for Integer Programming
• A Survey of Lagrangean Techniques for Discrete Optimization
• Finding the k Shortest Paths
• An efficient implementation of an algorithm for findingK shortest simple paths
• The Nonlinear Resource Allocation Problem
• Finding the K Shortest Loopless Paths in a Network
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
• \(p\)th power Lagrangian method for integer programming

This page was built for publication: Distance confined path problem and separable integer programming