Work

Tight Low-Complexity Approximation for the Q m ‖ C max Problem via Mathematical Programming Modeling

Year: 2026

Type: article

Source: INFORMS journal on computing

DOI: 10.1287/ijoc.2025.1129

Authors: Luca Savant Aira, Rosario Scatamacchia, Federico Della Croce di Dojola

Institutions: Politecnico di Torino, Institute of Electronics, Computer and Telecommunication Engineering, National Research Council

Language: English

Topic: Scheduling and Optimization Algorithms

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W7203626740

FWCI:

Cites: 20

Cited by:

Related to: