2000Computers & Operations ResearchRequires access

The column-circular, subsets-selection problem: complexity and solutions

Fayez F. Boctor, Jacques Renaud

Open publisher page 9 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 9 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.

Key concepts: Set packing, Set cover problem, Column generation, Covering problems, Mathematical optimization, Mathematics, Packing problems, Scheduling (production processes)

Related papers

Back to paper searchBrowse research topicsOriginal source
The column-circular, subsets-selection problem: complexity and solutions — Research Paper | ScholarLens