Pages that link to "Item:Q849073"

The following pages link to On solving the Lagrangian dual of integer programs via an incremental approach (Q849073):

Displaying 21 items.

• Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727) (← links)
• Spectral projected subgradient with a momentum term for the Lagrangean dual approach (Q878598) (← links)
• A partially inexact bundle method for convex semi-infinite minmax problems (Q907208) (← links)
• Repulsive assignment problem (Q963661) (← links)
• Lagrangian dual ascent by generalized linear programming (Q1123118) (← links)
• A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
• Comment on ''A nonlinear Lagrangian dual for integer programming''. (Q1417601) (← links)
• Lagrangian relaxation for SVM feature selection (Q1652409) (← links)
• Truck synchronization at single door cross-docking terminals (Q1656428) (← links)
• A method for convex minimization based on translated first-order approximations (Q1681778) (← links)
• An application-oriented guide for designing Lagrangean dual ascent algorithms (Q1824554) (← links)
• Lagrangian relaxation of the generic materials and operations planning model (Q2303321) (← links)
• A proximal-projection partial bundle method for convex constrained minimax problems (Q2313762) (← links)
• (Q3773696) (← links)
• A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (Q4637834) (← links)
• Minimizing Piecewise-Concave Functions Over Polyhedra (Q5219555) (← links)
• A splitting bundle approach for non-smooth non-convex minimization (Q5248228) (← links)
• Essentials of numerical nonsmooth optimization (Q5918756) (← links)
• Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method. (Q5928425) (← links)
• Essentials of numerical nonsmooth optimization (Q5970841) (← links)
• A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs (Q6087142) (← links)