activity
20172026
most citedRelaxation heuristics for the set multicover problem with generalized upper bound constraints

2 citations · 2 across the 4 of their papers we have counts for

collaborators

5 papers

cs.CC2026

Computational Complexity and Exact Algorithms for Pressure-Driven Hydrogen Charging

Nanase Sato, Wei Wu, Mutsunori Yagiura

We study the problem of deciding the feasibility of pressure-driven hydrogen charging from supply cylinders to demand cylinders without replenishment, asking whether an order of tr…

cs.DS2025

Fast approximation algorithms for the 1-median problem on real-world large graphs

Keisuke Ueta, Wei Wu, Mutsunori Yagiura

The 1-median problem (1MP) on undirected weighted graphs seeks to find a facility location minimizing the total weighted distance to all customer nodes. Although the 1MP can be sol…

cs.DM2023

Packing squares independently

Wei Wu, Hiroki Numaguchi, Yannan Hu +1

Given a set of squares and a strip of bounded width and infinite height, we consider a square strip packaging problem, which we call the square independent packing problem (SIPP),…

math.OC2020

An Iterated Dual Substitution Approach for Binary Integer Programming Problems under the Min-Max Regret Criterion

Wei Wu, Manuel Iori, Silvano Martello +1

We consider binary integer programming problems with the min-max regret objective function under interval objective coefficients. We propose a new heuristic framework, which we cal…

cs.DS2017★ 2 cited

Relaxation heuristics for the set multicover problem with generalized upper bound constraints

Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura

We consider an extension of the set covering problem (SCP) introducing (i)~multicover and (ii)~generalized upper bound (GUB)~constraints. For the conventional SCP, the pricing meth…