2006•Automation and Remote ControlRequires access

The three-dimensional assignment and partition problems. New lower bounds

S. I. Sergeev

Abstract

For the three-dimensional assignment problem, new sharp lower bounds are derived from its relationship with the partition problem. The new sharp lower bounds derived for the partition problem from optimal control theory are of great value not only for the three-dimensional assignment problem, but also for the partition problem itself.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Partition (number theory), Partition problem, Mathematics, Upper and lower bounds, Combinatorics, Mathematical optimization, Mathematical analysis