Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
From MaRDI portal
Publication:2052398
DOI10.1007/s10898-021-01027-wzbMath1481.90227arXiv2001.01794OpenAlexW3160604577MaRDI QIDQ2052398
Publication date: 26 November 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.01794
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- Solving mixed integer nonlinear programs by outer approximation
- Global optimization algorithm for capacitated multi-facility continuous location-allocation problems
- Decomposition-based inner- and outer-refinement algorithms for global optimization
- Fleet assignment and routing with schedule synchronization constraints
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Lagrangean relaxation. (With comments and rejoinder).
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A branch-and-reduce approach to global optimization
- A branch-and-cut method for 0-1 mixed convex programming
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables
- A scalable global optimization algorithm for stochastic nonlinear programs
- Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues
- Generalized Benders decomposition
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- The Operational Airline Crew Scheduling Problem
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems
- Outline of an algorithm for integer solutions to linear programs
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- Computing in Operations Research Using Julia
- 50 Years of Integer Programming 1958-2008
- Routing with time windows by column generation
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Selected Topics in Column Generation
- Solution of a Large-Scale Traveling-Salesman Problem
- Capacity planning with congestion effects
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
This page was built for publication: Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
