scientific article

zbMath1274.90291MaRDI QIDQ2861560

Nicolas Jozefowiez, Mohamed Ali Aloulou, Christian Artigues

Publication date: 8 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001575

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• The one-machine sequencing problem
• On the complexity of loop fusion
• A survey of scheduling problems with setup times or costs
• Multicriteria scheduling

This page was built for publication: