activity
20072024
most citedProduction-Inventory games: a new class of totally balanced combinatorial optimization games

73 citations · 328 across the 52 of their papers we have counts for

collaborators

56 papers

math.OC2024★ 1 cited

Constraint relaxation for the Discrete Ordered Median Problem

Luisa I. Martínez-Merino, Diego Ponce, Justo Puerto

This paper compares different exact approaches to solve the Discrete Ordered Median Problem (DOMP). In recent years, DOMP has been formulated using set packing constraints giving r…

cs.GT2024★ 73 cited

Production-Inventory games: a new class of totally balanced combinatorial optimization games

Luis A. Guardiola, Ana Meca, Justo Puerto

In this paper we introduce a new class of cooperative games that arise from production-inventory problems. Several agents have to cover their demand over a finite time horizon and…

cs.GT2024★ 25 cited

Production-inventory games and pmas games: characterizations of the Owen point

Luis A. Guardiola, Ana Meca, Justo Puerto

Production-inventory games were introduced in Guardiola et al. (2007) as a new class of totally balanced combinatorial optimization games. From among all core-allocations, the Owen…

cs.GT2024★ 15 cited

Dynamic Realization Games in Newsvendor Inventory Centralization

M. Dror, Luis A. Guardiola, Ana Meca +1

Consider a set N of n (>1) stores with single-item and single-period nondeterministic demands like in a classic newsvendor setting with holding and penalty costs only. Assume a ris…

cs.GT2024★ 5 cited

Unitary Owen points in cooperative lot-sizing models with backlogging

Luis A. Guardiola, Ana Meca, Justo Puerto

Cooperative lot-sizing models with backlogging and heterogeneous costs are studied in Guardiola et al. (2020). In this model several firms participate in a consortium aiming at sat…

math.CO2023

Budget-constrained cut problems

Justo Puerto, José L. Sainz-Pardo

The minimum and maximum cuts of an undirected edge-weighted graph are classic problems in graph theory. While the Min-Cut Problem can be solved in P, the Max-Cut Problem is NP-Comp…