scientific article; zbMATH DE number 2086935

zbMATH Open1049.90045MaRDI QIDQ4737540FDOQ4737540

Authors Diego Klabjan 

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2337/23370384.htm

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Subadditive approaches in integer programming
• A practical algorithm for computing a subadditive dual function for set partitioning
• scientific article; zbMATH DE number 2223038
• The group problem and integer programming duality
• Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations

Cited in

(10)

• Solving the \(p\)-median problem with a semi-Lagrangian relaxation
• Exploring the limits of subadditive approaches: parallels between optimization and complexity theory
• On a class of subadditive duals for the uncapacitated facility location problem
• A practical algorithm for computing a subadditive dual function for set partitioning
• A first look at picking dual variables for maximizing reduced cost fixing
• The group problem and integer programming duality
• Superadditive characterizations of pure integer programming feasibility
• Subadditive approaches in integer programming
• Critical review of pricing schemes in markets with non-convex costs
• Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach

This page was built for publication:

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