Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
type: Item
instance of: scholarly article
title: Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
zbMATH Open document ID: 1175.90168
author: Öncü Hazır
author: Mohamed Haouari
author: Erdal Erel
published in: Computers \& Operations Research
publication date: 2009-11-27T00:00:00Z
full work available at URL: http://hdl.handle.net/11693/22384
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5639637
zbMATH Keywords: project scheduling
zbMATH Keywords: time/cost trade-off
zbMATH Keywords: Benders decomposition
MaRDI profile type: Publication
OpenAlex ID: W2102204585
cites work: Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
cites work: The discrete time-cost tradeoff problem revisited
cites work: A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
cites work: Optimal procedures for the discrete time/cost trade-off problem in project networks
cites work: A Dynamic Programming Algorithm for Decision CPM Networks
cites work: New computational results on the discrete time/cost trade-off problem in project networks
cites work: Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
cites work: The discrete time/cost trade-off problem: Extensions and heuristic procedures
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: A survey on Benders decomposition applied to fixed-charge network design problems
cites work: Solving time/cost trade-off problems with discounted cash flows using generalized benders decomposition
cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
cites work: Finding the K Shortest Loopless Paths in a Network
cites work: A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
cites work: A Computational Study of Search Strategies for Mixed Integer Programming
cites work: Optimal Reduction of Two-Terminal Directed Acyclic Graphs
DOI: 10.1016/J.COR.2009.06.009
description: scientific article; zbMATH DE number 5639637