A reduction tree approach for the discrete time/cost trade-off problem (Q2147020)

From MaRDI portal

Revision as of 05:52, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A reduction tree approach for the discrete time/cost trade-off problem	scientific article

Statements

scholarly article

0 references

A reduction tree approach for the discrete time/cost trade-off problem (English)

0 references

0 references

Mario Vanhoucke

0 references

Computers \& Operations Research

0 references

publication date

22 June 2022

0 references

zbMATH Keywords

discrete time/cost trade-off

0 references

reduction tree

0 references

modular decomposition

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2022.105750

0 references

Network decomposition-based benchmark results for the discrete time-cost tradeoff problem

0 references

An agency perspective for multi-mode project scheduling with time/cost trade-offs

0 references

A linear-time approximation algorithm for the weighted vertex cover problem

0 references

Optimal Reduction of Two-Terminal Directed Acyclic Graphs

0 references

An exact composite lower bound strategy for the resource-constrained project scheduling problem

0 references

The discrete time-cost tradeoff problem revisited

0 references

Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks

0 references

On the use of the complexity index as a measure of complexity in activity networks

0 references

Hardness of approximation of the discrete time-cost tradeoff problem

0 references

New computational results on the discrete time/cost trade-off problem in project networks

0 references

Optimal procedures for the discrete time/cost trade-off problem in project networks

0 references

Resource allocation via dynamic programming in activity networks

0 references

Solving time/cost trade-off problems with discounted cash flows using generalized benders decomposition

0 references

A Network Flow Computation for Project Cost Curves

0 references

Project scheduling with irregular costs: complexity, approximability, and algorithms

0 references

Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version

0 references

Robust scheduling and robustness measures for the discrete time/cost trade-off problem

0 references

Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap

0 references

Metaheuristics for multi-mode capital-constrained project payment scheduling

0 references

Simulated annealing and tabu search for multi-mode project payment scheduling

0 references

Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective

0 references

Multi-mode project payment scheduling problems with bonus-penalty structure

0 references

Phase transitions in project scheduling

0 references

Vertex cover might be hard to approximate to within \(2 - \varepsilon \)

0 references

Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems

0 references

The impact of solution representations on heuristic net present value optimization in discrete time/cost trade-off project scheduling with multiple cash flow and payment models

0 references

On the minimum dummy-arc problem

0 references

A hybrid simulation-optimization approach for the robust discrete time/cost trade-off problem

0 references

Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem

0 references

An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs

0 references

A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem

0 references

New computational results for the discrete time/cost trade-off problem with time-switch constraints

0 references

An evaluation of the adequacy of project network generators with systematically sampled networks

0 references

The discrete time/cost trade-off problem: Extensions and heuristic procedures

0 references

Discrete time/cost trade-offs in project scheduling with time-switch constraints

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.COR.2022.105750

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2147020

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2147020&oldid=38906340"