# Axis 2: Decision support made in complex systems

Back## Cahiers du GERAD

### 1394 results — page 1 of 70

Branch-and-Price

Integer (linear) programs are a standard way of formalizing a vast array of optimization problems in industry, services, management, science, and technology....

BibTeX reference

We explore a *scaled* spectral preconditioner for the efficient solution of sequences of symmetric and positive-definite linear systems. We design the scaled...

Penalty methods are a well known class of algorithms for constrained optimization. They transform a constrained problem into a sequence of unconstrained _pe...

BibTeX reference

We develop R2N, a modified quasi-Newton method for minimizing the sum of a `\(\mathcal{C}^1\)`

function `\(f\)`

and a lower semi-continuous prox-bounded `(h...

In this report, we present our winning solution to the 16th AIMMS-MOPTA Optimization Modeling Competition on whether a fully renewable energy grid would bene...

BibTeX reference

Population growth and city sprawl have been driving increasing amounts of traffic congestion in multiple major cities worldwide. In this scenario, developing...

BibTeX referenceTight upper and lower bounds for the quadratic knapsack problem through binary decision diagram

The Quadratic Knapsack Problem (QKP) is a challenging combinatorial optimization problem that has attracted significant attention due to its complexity and p...

BibTeX referenceACAS: A comprehensive framework for automatic abstract screening in systematic literature reviews

When performing a Systematic Literature Review (SLR), the Abstract Screening Process (ASP) can be a very consuming and laborious task, especially when rese...

BibTeX reference

Designing efficient evacuation networks is crucial for disaster preparedness, as poorly planned and managed evacuations can increase the time required for ev...

BibTeX reference

The modelling of linear quadratic Gaussian optimal control problems on large complex networks is intractable computationally. Graphon theory provides an appr...

BibTeX reference

Major projects often deviate from their expected budget, schedule, and benefits. Existing techniques to improve the forecasted outcome, such as the Refer...

BibTeX reference

JSOSuite.jl is a new Julia package offering a user-friendly interface for continuous nonlinear optimization. The solvers available cover unconstrained to g...

BibTeX reference

The cubic knapsack problem (CKP) is a combinatorial optimization problem, which can be seen both as a generalization of the quadratic knapsack problem (QKP) ...

BibTeX reference

Over the past years, Robotic Process Automation (RPA) has emerged as a significant tool to enhance productivity across various industries by automating repet...

BibTeX reference

The increasing penetration of renewable electricity generation as well as the implementation of demand response programs has led to new challenges in the ope...

BibTeX reference

Local search methods start from a feasible solution and improve it by successive minor modifications until a solution that cannot be further improved is enco...

BibTeX reference

Governments are motivated to subsidize profit-driven firms that manufacture zero-emission vehicles to ensure they become price-competitive. This paper intr...

BibTeX reference

We extend traditional complexity analyses of trust-region methods for unconstrained, possibly nonconvex, optimization. Whereas most complexity analyses as...

BibTeX reference

We consider a provider of electric vehicle charging that operates a network of charging stations and uses time-varying pricing to maximize profit and reduce ...

BibTeX reference

The water pump scheduling problem is an optimisation model that determines which water pumps will be turned on or off at each time period over a given time h...

BibTeX reference