POLIP

library for polynomially constrained
mixed-integer programming


polip :: contents / contributors / instances / archive / bibliography

Easy  sched-6-4711

Namesched-6-4711
Classificationnc|bc|d2
Problem typemaxcut
DescriptionQuadratic model for the max-cut instance sched-6-4711
Objective sensemax
Variables16  (15 binary, 0 general integer, 1 continuous)
Nonlinear variables1
Constraints0
Nonlinear constraints1
Linear nonzeros0
Nonlinear nonzeros36
Download sched-6-4711.pip.gz sched-6-4711.gms.gz sched-6-4711.mod.gz sched-6-4711.zpl.gz
Best known solutionsched-6-4711.sol.gz
Best known objective12
Best known bound12
OriginatorMatthias Elf, Michael Jünger, Giovanni Rinaldi
FormulatorUlrike Pagacz
DonatorMichael Jünger
References ElfJuengerRinaldi2003
Links
Additional informationThis is a quadratic model for the max-cut problem. The instance arises when minimizing so-called breaks in sports tournaments.

© by maintainers  |     |  imprint