Road network emergency accessibility planning after a major earthquake
EURO Journal on Computational Optimization, 2016 In the aftermath of disasters such as major earthquakes, several roads may be blocked by rubble and the population tends to search refugee in certain gathering points of the city.
CelsoSatoshi Sakuraba +5 more
doaj
Multi-machine energy-aware scheduling
EURO Journal on Computational Optimization, 2017 The traditional set of manufacturing scheduling problems concern general and easy-to-measure economic objectives such as makespan and tardiness. The variable nature of energy costs over the course of the day remains mostly ignored by most previous ...
David Van Den Dooren +4 more
doaj
Optimization as an analysis tool for human complex decision making [PDF]
, 2011 We present a problem class of mixed-integer nonlinear programs (MINLPs) with nonconvex continuous relaxations which stem from economic test scenarios that are used in the analysis of human complex problem solving.
Barth, Dr Carola M. +4 more
core
McCormick envelopes in mixed-integer PDE-constrained optimization [PDF]
Mathematical programmingMcCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear ...
S. Leyffer, Paul Manns
semanticscholar +1 more source
Uncapacitated Lot-Sizing with Stock Upper Bounds, Stock Fixed Costs, Stock Overloads and Backlogging: A Tight Formulation [PDF]
, 2015 For an n-period uncapacitated lot-sizing problem with stock upper bounds, stock fixed costs, stock overload and backlogging, we present a tight extended shortest path formulation of the convex hull of solutions with O(n^2) variables and constraints, also
Wolsey, Laurence
core
Approximation of corner polyhedra with families of intersection cuts
, 2017 We study the problem of approximating the corner polyhedron using intersection cuts derived from families of lattice-free sets in $\mathbb{R}^n$. In particular, we look at the problem of characterizing families that approximate the corner polyhedron up ...
A Basu +12 more
core +1 more source
Adaptive large neighborhood search for mixed integer programming
Mathematical Programming Computation, 2018 Large Neighborhood Search (LNS) heuristics are among the most powerful but also most expensive heuristics for mixed integer programs (MIP). Ideally, a solver adaptively concentrates its limited computational budget by learning which LNS heuristics work ...
Gregor Hendel
semanticscholar +1 more source
Convex approximations for a class of mixed-integer recourse models [PDF]
We consider mixed-integer recourse (MIR) models with a single recourse constraint.We relate the secondstage value function of such problems to the expected simple integer recourse (SIR) shortage function.
Vlerk, Maarten H. van der
core +1 more source
Stabilized Benders methods for large-scale combinatorial optimization, with appllication to data privacy [PDF]
, 2017 The Cell Suppression Problem (CSP) is a challenging Mixed-Integer Linear Problem arising in statistical tabular data protection. Medium sized instances of CSP involve thousands of binary variables and million of continuous variables and constraints ...
Baena, Daniel +2 more
core +1 more source
Optimizing electricity distribution using two-stage integer recourse models [PDF]
We consider two planning problems faced by an electricity distributor. Electricity can be ob-tained both from power plants and small generators such as hospitals and greenhouses, whereas the future demand for electricity is uncertain.
Klein Haneveld, W.K. +1 more
core +1 more source