A dynamic discrete network design problem for maintenance planning in traffic networks
type: Item
instance of: scholarly article
title: A dynamic discrete network design problem for maintenance planning in traffic networks
zbMATH Open document ID: 1380.90071
author: Pirmin Fontaine
author: Stefan Minner
published in: Annals of Operations Research
publication date: 2018-02-08T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B25
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6836016
zbMATH Keywords: dynamic discrete network design problem
zbMATH Keywords: bilevel programming
zbMATH Keywords: Benders decomposition
MaRDI profile type: Publication
full work available at URL: s10479-016-2171-y
OpenAlex ID: W2308254628
cites work: Practical bilevel optimization. Algorithms and applications
cites work: Computational Difficulties of Bilevel Linear Programming
cites work: Construction of a real-world bilevel linear programming model of the highway network design problem
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
cites work: An overview of bilevel optimization
cites work: Foundations of bilevel programming
cites work: Bilevel Programming Problems
cites work: An algorithm for the mixed-integer nonlinear bilevel programming problem
cites work: A review of urban transportation network design problems
cites work: A branch and bound algorithm for bi-level discrete network design problem
cites work: Q4040221
cites work: Hybrid meta-heuristic algorithms for solving network design problem
cites work: Q5692145
DOI: 10.1007/S10479-016-2171-Y
description: scientific article; zbMATH DE number 6836016