Distance confined path problem and separable integer programming

DOI10.1080/02331934.2012.660484MaRDI QIDQ2841138zbMATH OpenOpenAlexWikidataFDO

Authors Duan Li, Chuyun Wang, Yirong Yao

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) Nonlinear programming (90C30) Integer programming (90C10) Boolean programming (90C09)

Recommendations

• AN IMPROVED SURROGATE CONSTRAINTS METHOD FOR SEPARABLE NONLINEAR INTEGER PROGRAMMING
• scientific article; zbMATH DE number 3934777
• Surrogate Constraints
• Nonlinear integer programming for various forms of constraints
• Reduction of nonlinear integer separable programming problems^∗

Cites work

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

Cited in

(1)

• Distances between optimal solutions of mixed-integer programs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841138)