Reference health

Prioritizing road extension projects with interdependent benefits under time constraint

https://doi.org/10.1016/j.tra.2015.03.016
CiteStamped reference-health badge
2 of 31 checkable references need attention · checked 2026-07-23

At the dated check, the references listed below either did not resolve in Crossref or DataCite, or carried a retraction notice. Each one is shown with the registry record that put it there.

18 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.

References needing attention

does not resolve to a known work10.3141/1931-10
does not resolve to a known work10.3141/1981-21
The 29 checked references that resolve
resolves10.1080/0308106042000316367
Braess' phenomenon in the management of networks and dissociation of equilibrium concepts
resolves10.1504/IJLSM.2012.044052
An efficient hybrid heuristic method for prioritising large transportation projects with interdependent activities
resolves10.1504/IJLSM.2013.055561
A hybrid meta-heuristic algorithm for solving real-life transportation network design problems
resolves10.1093/biomet/54.3-4.357
The discarding of variables in multivariate analysis
resolves10.1007/s11116-004-7271-x
Evaluation, prioritization and selection of transportation investment projects in New York City
resolves10.1287/trsc.1050.0127
On a Paradox of Traffic Planning
resolves10.1109/TEM.1971.6447136
Investment model for R&D project evaluation and selection
resolves10.1109/3477.484436
Ant system: optimization by a colony of cooperating agents
resolves10.1287/mnsc.30.7.890
Economic Models for R and D Project Selection in the Presence of Project Interactions
resolves10.1111/j.1540-5915.1980.tb01174.x
A NOTE ON MODELING PROJECT INTERDEPENDENCE IN RESEARCH AND DEVELOPMENT*
resolves10.1017/CBO9781107325678.006
On greedy algorithms that succeed
resolves10.1007/BF01088596
Dynamic priority scheduling of periodic and aperiodic tasks in hard real-time systems
resolves10.1061/(ASCE)0733-947X(1991)117:4(457)
Network Design Programming of U.S. Highway Improvements
resolves10.1287/opre.33.4.803
Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
resolves10.1061/(ASCE)0733-950X(2001)127:1(45)
Genetic Algorithm for Selecting and Scheduling Interdependent Projects
resolves10.1016/0041-1647(75)90030-1
An efficient approach to solving the road network equilibrium traffic assignment problem
resolves10.1016/j.trb.2008.06.005
Time-dependent transport network design under cost-recovery
resolves10.3141/1882-11
Methodology for Determining Vulnerable Links in a Transportation Network
resolves10.1287/mnsc.15.9.494
Discrete Dynamic Programming and Capital Allocation
resolves10.1016/j.apgeog.2012.01.010
A network-based approach for evaluating and ranking transportation roadway projects
resolves10.1016/S0191-2615(96)00024-0
Braess' paradox: Some new insights
resolves10.1007/s11590-007-0049-2
A unified network performance measure with importance identification and the ranking of network components
resolves10.1016/0191-2615(79)90006-7
Application of optimal subset selection to problems of design and scheduling in urban transportation networks
resolves10.1287/mnsc.46.5.710.12044
Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements
resolves10.1061/(ASCE)IS.1943-555X.0000102
Spending Scarce Funds More Efficiently—Including the Pattern of Interdependence in Cost-Benefit Analysis
resolves10.3141/2039-02
Island Models for Stochastic Problem of Transportation Project Selection and Scheduling
resolves10.1007/s11067-013-9187-5
Linear Programming Formulation for Strategic Dynamic Traffic Assignment
resolves10.3141/2273-01
Simulation-Based Scheduling of Mutually Exclusive Projects with Precedence and Regional Budget Constraints
resolves10.1287/mnsc.12.7.485
Capital Budgeting of Interrelated Projects: Survey and Synthesis
The 18 references without a DOI — listed, not checked
no DOI — not checkedActon, Q.A., 2012. Issues in Computer Science and Theory: 2011 Edition. Scholarly Editions.
no DOI — not checkedA heuristic methodology to tackle the Braess Paradox detecting problem tailored for real road networks
no DOI — not checked10.1016/j.tra.2015.03.016_b0040
no DOI — not checked10.1016/j.tra.2015.03.016_b0055
no DOI — not checkedDomencich, T.A., McFadden, D., 1975. Urban Travel Demand-A Behavioral Analysis.
no DOI — not checkedEdmonds, J., 1970. Submodular functions, matroids, and certain polyhedra. Combinatorial Structures and Their Applications, pp. 69–87.
no DOI — not checked10.1016/j.tra.2015.03.016_b0085
no DOI — not checkedINRO, 2007. EMME3, EMME3 User’s Guide, Montreal, Quebec, Canada.
no DOI — not checkedNahmias, S., Cheng, Y., 2009. Production and Operations Analysis, vol. 5, McGraw-Hill, New York.
no DOI — not checked10.1016/j.tra.2015.03.016_b0155
no DOI — not checkedSalim, V., 1998. A comparison of different methods for selecting and scheduling transport investments. Australasian Transport Research Forum (ATRF), 22ND, 1998.
no DOI — not checked10.1016/j.tra.2015.03.016_b0170
no DOI — not checkedSheffi, Y., 1985. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods.
no DOI — not checkedSheffi, Y., 2005. The resilient Enterprise: Overcoming Vulnerability for Competitive Advantage, vol. 1. MIT Press Books.
no DOI — not checked10.1016/j.tra.2015.03.016_b0195
no DOI — not checkedUsing GA to optimize the selection and scheduling of road projects
no DOI — not checked10.1016/j.tra.2015.03.016_b0225
no DOI — not checkedTime-dependent discrete transportation network design
What this badge says. CiteStamped means the CHECKABLE references of this work were clean at the dated check: each resolved to a known work in a public registry, and none carried a retraction notice at that time. It says nothing about the quality, findings, or importance of the work itself, and nothing about references deposited without a DOI.

checked 2026-07-23 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record

Embed this badge

Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.

<a href="https://citestamp.com/citestamped/10.1016/j.tra.2015.03.016"><img src="https://citestamp.com/citestamped/10.1016/j.tra.2015.03.016/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.1016/j.tra.2015.03.016/badge.svg)](https://citestamp.com/citestamped/10.1016/j.tra.2015.03.016)