A Lagrangian heuristic for sprint planning in agile software development

DOI10.1016/j.cor.2013.09.007zbMath1348.68036DBLPjournals/cor/BoschettiGRT14OpenAlexW2091413362WikidataQ59374167 ScholiaQ59374167MaRDI QIDQ336900

Elisa Turricchia, Matteo Golfarelli, Stefano Rizzi, Marco Antonio Boschetti

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.09.007

zbMATH Keywords

mixed integer linear programmingsoftware engineeringLagrangian heuristicsmatheuristicsoptimization modelsagile methods

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A computational study of exact knapsack separation for the generalized assignment problem
• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
• Benders decomposition, Lagrangean relaxation and metaheuristic design
• An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
• New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem

This page was built for publication: A Lagrangian heuristic for sprint planning in agile software development