A Branch-and-Cut Algorithm for the Minimum Weight 3-Coloring Problem - Conference attendances

A Branch-and-Cut Algorithm for the Minimum Weight 3-Coloring Problem Conference attendances

Language

Английский

Participant type

Секционный

URL

https://conference.icc.ru/event/9/attachments/8/401/MOTOR2026_Program.pdf

Conference

Mathematical Optimization Theory and Operations Research 2026
06-11 Jul 2026 , Иркутск

Authors

Zhukov G ¹ , Erzin A ^1,2 , Plotnikov R ³

Affiliations

1	Novosibirsk State University
2	Sobolev Institute of Mathematics, Siberian Branch of Russian Academy of Sciences, Novosibirsk, 630090, Russia
3	LEDAS Ltd.

Zhukov G. , Erzin A. , Plotnikov R.
A Branch-and-Cut Algorithm for the Minimum Weight 3-Coloring Problem
Mathematical Optimization Theory and Operations Research 2026 06-11 Jul 2026