22 citations · 51 across the 12 of their papers we have counts for
14 papers
Branch and price for nonlinear production-maintenance scheduling in complex machinery
João Dionísio, Ambros Gleixner, João Pedro Pedroso +1
This paper proposes a mixed-integer nonlinear programming approach for joint scheduling of long-term maintenance decisions and short-term production for groups of complex machines…
Computing Nash equilibria for integer programming games
Margarida Carvalho, Andrea Lodi, João Pedro Pedroso
The recently defined class of integer programming games (IPG) models situations where multiple self-interested decision makers interact, with their strategy sets represented by a f…
Novel Integer Programming models for the stable kidney exchange problem
Xenia Klimentova, Péter Biró, Ana Viana +2
Kidney exchange programs (KEP's) represent an additional possibility of transplant for patients suffering from end stage kidney disease. If a patient has a willing living donor wit…
The Sea Exploration Problem: Data-driven Orienteering on a Continuous Surface
João Pedro Pedroso, Alpar Vajk Kramer, Ke Zhang
This paper describes a problem arising in sea exploration, where the aim is to schedule the expedition of a ship for collecting information about the resources on the seafloor. The…
Exact Methods for Recursive Circle Packing
Ambros Gleixner, Stephen Maher, Benjamin Müller +1
Packing rings into a minimum number of rectangles is an optimization problem which appears naturally in the logistics operations of the tube industry. It encompasses two major diff…
A Practical Algorithm for Packing Tubes and Boxes
João Pedro Pedroso, João Nuno Tavares, Jorge Leite
In this paper we describe a method for packing tubes and boxes in containers. Each container is divided into parts (holders) which are allocated to subsets of objects. The method c…
Heuristics for Packing Semifluids
João Pedro Pedroso
Physical properties of materials are seldom studied in the context of packing problems. In this work we study the behavior of semifluids: materials with particular characteristics,…
Maximum-expectation matching under recourse
João Pedro Pedroso, Shiro Ikeda
This paper addresses the problem of maximizing the expected size of a matching in the case of unreliable vertices and/or edges. The assumption is that upon failure, remaining verti…
Cutting Stock with Binary Patterns: Arc-flow Formulation with Graph Compression
Filipe Brandão, João Pedro Pedroso
The cutting stock problem with binary patterns (0-1 CSP) is a variant of CSP that usually appears as a relaxation of 2D and 3D packing problems. We present an exact method, based o…
An evolutionary solver for linear integer programming
João Pedro Pedroso
In this paper we introduce an evolutionary algorithm for the solution of linear integer programs. The strategy is based on the separation of the variables into the integer subset a…
Equilibria on a Game with Discrete Variables
João Pedro Pedroso, Yves Smeers
Equilibrium in Economics has been seldom addressed in a situation where some variables are discrete. This work introduces a problem related to lot-sizing with several players, and…
Unit commitment with valve-point loading effect
João Pedro Pedroso, Mikio Kubo, Ana Viana
Valve-point loading affects the input-output characteristics of generating units, bringing the fuel costs nonlinear and nonsmooth. This has been considered in the solution of load…
Multiple-choice Vector Bin Packing: Arc-flow Formulation with Graph Compression
Filipe Brandão, João Pedro Pedroso
The vector bin packing problem (VBP) is a generalization of bin packing with multiple constraints. In this problem we are required to pack items, represented by p-dimensional vecto…
Bin Packing and Related Problems: General Arc-flow Formulation with Graph Compression
Filipe Brandão, João Pedro Pedroso
We present an exact method, based on an arc-flow formulation with side constraints, for solving bin packing and cutting stock problems --- including multi-constraint variants --- b…