The \(\gamma\)-connected assignment problem

DOI10.1016/S0377-2217(98)00305-1zbMath0944.90036OpenAlexW2066200990MaRDI QIDQ1307813

Eduardo Uchoa, Marcus Poggi de Aragão

Publication date: 4 May 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00305-1

zbMATH Keywords

integer programmingclusteringassignmentpricingcutting

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

Partitioning a graph into balanced connected classes: formulations, separation and experiments

Uses Software

• ABACUS

Cites Work

• ABACUS
• A Polynomial Solution to the Undirected Two Paths Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The \(\gamma\)-connected assignment problem