A hybrid approach of bundle and Benders applied large mixed linear integer problem

DOI10.1155/2013/678783zbMath1271.90049OpenAlexW1978883808WikidataQ59003712 ScholiaQ59003712MaRDI QIDQ364462

Paulo Roberto Oliveira, Placido Rogerio Pinheiro

Publication date: 9 September 2013

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/678783

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05)

Related Items (2)

Dealing with nonregular shapes packing ⋮ The Benders decomposition algorithm: a literature review

Uses Software

• CPLEX
• MINTO
• NOA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Benders decomposition based heuristic for the hierarchical production planning problem
• On the convergence of cross decomposition
• Large-scale mixed integer programming: Benders-type heuristics
• Cross decomposition applied to the stochastic transportation problem
• Proximity control in bundle methods for convex nondifferentiable minimization
• On the resemblance between the Kornai-Liptak and cross decomposition techniques for block-angular linear programs
• Partitioning procedures for solving mixed-variables programming problems
• Newton's method for convex programming and Tschebyscheff approximation
• Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
• A Lagrangean heuristic for the facility location problem with staircase costs
• Mean value cross decomposition applied to integer programming problems
• A technique for speeding up the solution of the Lagrangean dual
• MINTO, a Mixed INTeger Optimizer
• On using approximations of the Benders master problem
• Solving the staircase cost facility location problem with decomposition and piecewise linearization
• A preconditioning proximal Newton method for nondifferentiable convex optimization
• Approximations in proximal bundle methods and decomposition of convex programs
• Methods of descent for nondifferentiable optimization
• A cross decomposition algorithm for a multiproduct-multitype facility location problem
• Minimization of functions having Lipschitz continuous first partial derivatives
• Generalized Benders decomposition
• Decomposition Principle for Linear Programs
• The Cutting-Plane Method for Solving Convex Programs
• A Cross Decomposition Algorithm for Capacitated Facility Location
• A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
• A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• A convergence proof for linear mean value cross decomposition
• Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts
• Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts
• Cross decomposition for mixed integer programming
• Validation of subgradient optimization
• Two-Level Planning
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Minimization of unsmooth functionals
• The traveling-salesman problem and minimum spanning trees: Part II

This page was built for publication: A hybrid approach of bundle and Benders applied large mixed linear integer problem