The mathematics of playing golf, or: A new class of difficult nonlinear mixed integer programs

DOI10.1007/s101070200298zbMath1010.90066OpenAlexW2110630308WikidataQ58002920 ScholiaQ58002920MaRDI QIDQ1849260

Giovanni Rinaldi, Ulrich Voigt, Gerhard J. Woeginger

Publication date: 1 December 2002

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070200298

zbMATH Keywords

computational complexitynonlinear optimizationNP-hard problemintegralitymixed integer programgolf problem

Mathematics Subject Classification ID

Nonlinear programming (90C30) Combinatorial optimization (90C27)

Related Items (2)

Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction ⋮ First-break-heuristically-schedule: constructing highly-constrained sports timetables

This page was built for publication: The mathematics of playing golf, or: A new class of difficult nonlinear mixed integer programs