A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables

DOI10.1016/j.ejor.2013.07.003zbMath1305.90336OpenAlexW2028319188MaRDI QIDQ2255939

Daniel Scholz, Anita Schöbel

Publication date: 18 February 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.07.003

zbMATH Keywords

global optimizationcombinatorial optimizationnon-convex optimizationmixed-integer optimizationfacility location problemsbranch-and-bound methods

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Discrete location and assignment (90B80)

Related Items (2)

A geometric branch-and-bound algorithm for the service bundle design problem ⋮ Solving the 1-median problem on a network with continuous demand and demand surplus

Uses Software

• Bonmin

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A global optimization procedure for the location of a median line in the three-dimensional space
• The theoretical and empirical rate of convergence for geometric branch-and-bound methods
• Deterministic global optimization. Geometric branch-and-bound methods and their applications
• Theoretical rate of convergence for interval inclusion functions
• Solving scheduling and location problems in the plane simultaneously
• The big cube small cube solution method for multidimensional facility location problems
• Equity models in planar location
• Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
• An algorithmic framework for convex mixed integer nonlinear programs
• A branch-and-price algorithm for the multi-source Weber problem
• On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems
• Constructing a DC decomposition for ordered median problems
• Continuous location problems and big triangle small triangle: Constructing better bounds
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
• Quadratic programming with one negative eigenvalue is NP-hard
• GBSSS: The generalized big square small square method for planar single- facility location
• Discrete and geometric branch and bound algorithms for~medical image registration
• Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
• Solving the ordered one-median problem in the plane
• Twins of powerful numbers
• Global Optimization with Polynomials and the Problem of Moments
• Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming
• Location Theory
• Locating Objects in the Plane Using Global Optimization Techniques
• On the Complexity of Some Common Geometric Location Problems
• Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• The multi-source Weber problem with constant opening cost
• Decomposition strategies for large-scale continuous location–allocation problems
• Convex analysis and global optimization
• Introduction to global optimization.

This page was built for publication: A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables