A survey of the literature on airline crew scheduling

M Deveci, NC Demirel - Engineering Applications of Artificial Intelligence, 2018 - Elsevier
As the airline industry is ever expanding, companies are increasing their fleet sizes to obtain
greater market shares. Moreover, as the airlines seek more growth, the complexity and size …

Mixed-integer nonlinear optimization

P Belotti, C Kirches, S Leyffer, J Linderoth, J Luedtke… - Acta Numerica, 2013 - cambridge.org
Many optimal decision problems in scientific, engineering, and public sector applications
involve both discrete decisions and nonlinear system dynamics that affect the quality of the …

Convex models of distribution system reconfiguration

JA Taylor, FS Hover - IEEE Transactions on Power Systems, 2012 - ieeexplore.ieee.org
We derive new mixed-integer quadratic, quadratically constrained, and second-order cone
programming models of distribution system reconfiguration, which are to date the first …

The MILP road to MIQCP

S Burer, A Saxena - Mixed integer nonlinear programming, 2011 - Springer
This paper surveys results on the NP-hard mixed-integer quadratically constrained
programming problem. The focus is strong convex relaxations and valid inequalities, which …

Solving the optimal trading trajectory problem using a quantum annealer

G Rosenberg, P Haghnegahdar, P Goddard… - Proceedings of the 8th …, 2015 - dl.acm.org
We solve a multi-period portfolio optimization problem using D-Wave Systems' quantum
annealer. We derive a formulation of the problem, discuss several possible integer encoding …

Branching and bounds tighteningtechniques for non-convex MINLP

P Belotti, J Lee, L Liberti, F Margot… - Optimization Methods & …, 2009 - Taylor & Francis
Many industrial problems can be naturally formulated using mixed integer non-linear
programming (MINLP) models and can be solved by spatial Branch&Bound (sBB) …

A simple effective heuristic for embedded mixed-integer quadratic programming

R Takapoui, N Moehle, S Boyd… - International journal of …, 2020 - Taylor & Francis
In this paper, we propose a fast optimisation algorithm for approximately minimising convex
quadratic functions over the intersection of affine and separable constraints (ie the Cartesian …

[PDF][PDF] Solving mixed-integer quadratic programming problems with IBM-CPLEX: a progress report

C Bliek1ú, P Bonami, A Lodi - Proceedings of the twenty-sixth …, 2014 - researchgate.net
Solving Mixed-Integer Quadratic Programming problems with IBM-CPLEX: a progress report
Page 1 Proceedings of the Twenty-Sixth RAMP Symposium Hosei University, Tokyo, October …

Sparse regression at scale: Branch-and-bound rooted in first-order optimization

H Hazimeh, R Mazumder, A Saab - Mathematical Programming, 2022 - Springer
We consider the least squares regression problem, penalized with a combination of the ℓ _ 0
ℓ 0 and squared ℓ _ 2 ℓ 2 penalty functions (aka ℓ _0 ℓ _2 ℓ 0 ℓ 2 regularization). Recent …

Heuristic algorithms for the cardinality constrained efficient frontier

M Woodside-Oriakhi, C Lucas, JE Beasley - European Journal of …, 2011 - Elsevier
This paper examines the application of genetic algorithm, tabu search and simulated
annealing metaheuristic approaches to finding the cardinality constrained efficient frontier …