The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Resource Constrained Shortest Paths
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“knowing that the resource-constrained shortest path problem is NP-hard even with one resource (Mehlhorn and Ziegelmann, 2000).”
From Scheduling multiple agile Earth observation satellites with multiple observations (2026) · cites this paper as Mehlhorn and Ziegelmann, 2000
In the citing paper
“The worst-case complexity of Algorithm 1 is exponential”
From Scheduling multiple agile Earth observation satellites with multiple observations (2026) · cites this paper as Mehlhorn and Ziegelmann, 2000
Citations
Cites
Eppstein, D. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539795290477 · Cited by 1,381
The LEDA platform for combinatorial and geometric computing
Mehlhorn, K., Näher, S., & Uhrig, C. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63165-8_161 · Cited by 1,199
Self-citationApproximation Schemes for the Restricted Shortest Path Problem
Hassin, R. (1992) · Mathematics of Operations Research · doi:10.1287/moor.17.1.36 · Cited by 557
Hansen, P. (1980) · Lecture Notes in Economics and Mathematical Systems · doi:10.1007/978-3-642-48782-8_9 · Cited by 525
A dual algorithm for the constrained shortest path problem
Handler, G. Y., & Zang, I. (1980) · Networks · doi:10.1002/net.3230100403 · Cited by 457
Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
Warburton, A. R. (1987) · Operations Research · doi:10.1287/opre.35.1.70 · Cited by 328
An algorithm for the resource constrained shortest path problem
Beasley, J. E., & Christofides, N. (1989) · Networks · doi:10.1002/net.3230190402 · Cited by 327
The network inhibition problem
Phillips, C. A. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167286 · Cited by 236
The shortest route problem with constraints
Joksch, H. C. (1966) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(66)90020-5 · Cited by 214
Cook, W. J., Cunningham, W. H., Pulleyblank, W. R., & Schrijver, A. (1997) · Wiley eBooks · doi:10.1002/9781118033142 · Cited by 203
Research works printed but not linked: 1
- V. Jiminez and A. Marzal. Computing the k shortest paths. A new algorithm and an experimental comparison. In Proc. 3rd Workshop on Algorithm Engineering (WAE99), LNCS 1668, pages 25–29, 1999.
Cited by
Selected Topics in Column Generation
Lübbecke, M. E., & Desrosiers, J. (2005) · Operations Research · doi:10.1287/opre.1050.0234 · Cited by 1,102
Righini, G., & Salani, M. (2006) · Discrete Optimization · doi:10.1016/j.disopt.2006.05.007 · Cited by 364
Jia, Z., Sheng, M., Li, J., Niyato, D., & Han, Z. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3021255 · Cited by 271
System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
Jahn, O., Möhring, R. H., Schulz, A. S., & Stier‐Moses, N. E. (2005) · Operations Research · doi:10.1287/opre.1040.0197 · Cited by 267
Dumitrescu, I., & Boland, N. (2003) · Networks · doi:10.1002/net.10090 · Cited by 199
Urban navigation beyond shortest route: The case of safe paths
Galbrun, E., Pelechrinis, K., & Terzi, E. (2015) · Information Systems · doi:10.1016/j.is.2015.10.005 · Cited by 136
Counterexample Generation in Probabilistic Model Checking
Han, T., Katoen, J.-P., & Damman, B. (2009) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2009.5 · Cited by 144
Path-Constrained Traffic Assignment: Model and Algorithm
Jiang, N., Xie, C., & Waller, S. T. (2012) · Transportation Research Record Journal of the Transportation Research Board · doi:10.3141/2283-03 · Cited by 115
Modelling the mobile target covering problem using flying drones
Pugliese, L. D. P., Guerriero, F., Zorbas, D., & Razafindralambo, T. (2015) · Optimization Letters · doi:10.1007/s11590-015-0932-1 · Cited by 93
Electric bus fleet composition and scheduling
Yıldırım, Ş., & Yıldız, B. (2021) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2021.103197 · Cited by 111
Acceleration of Shortest Path and Constrained Shortest Path Computation
Köhler, E., Möhring, R. H., & Schilling, H. (2005) · Lecture notes in computer science · doi:10.1007/11427186_13 · Cited by 108
Counterexamples in Probabilistic Model Checking
Han, T., & Katoen, J.-P. (2007) · Springer eBooks · doi:10.1007/978-3-540-71209-1_8 · Cited by 108
Pareto Shortest Paths is Often Feasible in Practice
Müller‐Hannemann, M., & Weihe, K. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44688-5_15 · Cited by 79
The electric vehicle touring problem
Liao, C.-S., Lu, S.-H., & Shen, Z. M. (2016) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2016.02.002 · Cited by 91
Effective indexing for approximate constrained shortest path queries on large road networks
Wang, S., Xiao, X., Yang, Y., & Lin, W. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/3015274.3015277 · Cited by 92
Energy-efficient shortest routes for electric and hybrid vehicles
Strehler, M., Merting, S., & Schwan, C. (2017) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2017.03.007 · Cited by 78
On the cardinality of the Pareto set in bicriteria shortest path problems
Müller‐Hannemann, M., & Weihe, K. (2006) · Annals of Operations Research · doi:10.1007/s10479-006-0072-1 · Cited by 68
Faster BlockMax WAND with Variable-sized Blocks
Mallia, A., Ottaviano, G., Porciani, E., Tonellotto, N., & Venturini, R. (2017) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3077136.3080780 · Cited by 69
Finding All Attractive Train Connections by Multi-criteria Pareto Search
Müller‐Hannemann, M., & Schnee, M. (2007) · Springer eBooks · doi:10.1007/978-3-540-74247-0_13 · Cited by 64
Xiao, Y., Thulasiraman, K., Xue, G., Jüttner, A., & Arumugam, S. (2005) · doi:10.1080/09728600.2005.12088797 · Cited by 55
Storandt, S. (2012) · Proceedings of the International Conference on Automated Planning and Scheduling · doi:10.1609/icaps.v22i1.13495 · Cited by 51
A Lazy Version of Eppstein’s K Shortest Paths Algorithm
Jiménez, V., & Marzal, A. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44867-5_14 · Cited by 50
Cost-Based Filtering for Shorter Path Constraints
Sellmann, M. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45193-8_47 · Cited by 56
Zhu, X., & Wilhelm, W. E. (2011) · Computers & Operations Research · doi:10.1016/j.cor.2011.03.008 · Cited by 51
Constrained shortest path query in a large time-dependent graph
Yuan, Y., Lian, X., Wang, G., Ma, Y., & Wang, Y. (2019) · Proceedings of the VLDB Endowment · doi:10.14778/3339490.3339491 · Cited by 39
Diagnosis, synthesis and analysis of probabilistic models
Han, T. (2009) · doi:10.3990/1.9789036528580 · Cited by 50
Typical properties of winners and losers in discrete optimization
Beier, R., & Vöcking, B. (2004) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1007352.1007409 · Cited by 38
Duty Scheduling in Public Transit
Grötschel, M., Borndörfer, R., & Löbel, A. (2003) · Springer eBooks · doi:10.1007/978-3-642-55753-8_50 · Cited by 51
Column generation based heuristic framework for the multiple-depot vehicle type scheduling problem
Guedes, P. C., & Borenstein, D. (2015) · Computers & Industrial Engineering · doi:10.1016/j.cie.2015.10.004 · Cited by 47
Polynomial-time Construction of Contraction Hierarchies for Multi-criteria Objectives
Funke, S., & Storandt, S. (2013) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611972931.4 · Cited by 34
Optimal Routing for Plug-In Hybrid Electric Vehicles
Nejad, M., Mashayekhy, L., Grosu, D., & Chinnam, R. B. (2017) · Transportation Science · doi:10.1287/trsc.2016.0706 · Cited by 36
Shortest Paths with Higher-Order Regularization
Ulén, J., Strandmark, P., & Kahl, F. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2409869 · Cited by 40
Integration of Vehicle and Duty Scheduling in Public Transport
Weider, S. (2007) · DepositOnce · doi:10.14279/depositonce-1672 · Cited by 38
Tsaggouris, G., & Zaroliagis, C. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30140-0_72 · Cited by 30
Ship Scheduling with Recurring Visits and Visit Separation Requirements
Sigurd, M. M., Ulstein, N. L., Nygreen, B., & Ryan, D. M. (2006) · Springer eBooks · doi:10.1007/0-387-25486-2_8 · Cited by 39
Karaman, S., & İnalhan, G. (2008) · IFAC Proceedings Volumes · doi:10.3182/20080706-5-kr-1001.02255 · Cited by 32
Engineer, F. G., Nemhauser, G. L., & Savelsbergh, M. W. P. (2010) · INFORMS journal on computing · doi:10.1287/ijoc.1100.0384 · Cited by 27
Network Optimization Models for Resource Allocation in Developing Military Countermeasures
Golany, B., Kress, M., Penn, M., & Rothblum, U. G. (2012) · Operations Research · doi:10.1287/opre.1110.1002 · Cited by 27
Computing representations using hypervolume scalarizations
Paquete, L., Schulze, B., Stiglmayr, M., & Lourenço, A. C. V. (2021) · Computers & Operations Research · doi:10.1016/j.cor.2021.105349 · Cited by 26
Solving resource constrained shortest path problems with LP-based methods
Horváth, M., & Kis, T. (2016) · Computers & Operations Research · doi:10.1016/j.cor.2016.04.013 · Cited by 32
Scheduling multiple agile Earth observation satellites with multiple observations
Wang, X., Han, C., & Leus, R. (2026) · Advances in Space Research · doi:10.1016/j.asr.2025.10.042 · Cited by 24
A Reference Point Approach for the Resource Constrained Shortest Path Problems
Pugliese, L. D. P., & Guerriero, F. (2012) · Transportation Science · doi:10.1287/trsc.1120.0418 · Cited by 24
Resource Constrained Shortest Path Problems in Path Planning for Fleet Management
Avella, P., Boccia, M., & Sforza, A. (2004) · Journal of Mathematical Modelling and Algorithms · doi:10.1023/b:jmma.0000026675.50719.ce · Cited by 25
Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
Andreas, A. K., & Smith, J. C. (2008) · INFORMS journal on computing · doi:10.1287/ijoc.1080.0266 · Cited by 23
Two-phase bicriterion search for finding fast and efficient electric vehicle routes
Goodrich, M. T., & Pszona, P. (2014) · ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL GIS) · doi:10.1145/2666310.2666382 · Cited by 22
Dynamic programming approaches to solve the shortest path problem with forbidden paths
Pugliese, L. D. P., & Guerriero, F. (2011) · Optimization methods & software · doi:10.1080/10556788.2011.630077 · Cited by 24
A Mobile Application for Real-Time Multimodal Routing Under a Set of Users’ Preferences
Gkiotsalitis, K., & Stathopoulos, A. (2014) · Journal of Intelligent Transportation Systems · doi:10.1080/15472450.2013.856712 · Cited by 27
Constrained shortest link-disjoint paths selection: a network programming based approach
Xiao, Y., Thulasiraman, K., & Xue, G. (2006) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/tcsi.2006.869907 · Cited by 21
Weight-Constrained Route Planning Over Time-Dependent Graphs
Yuan, Y., Lian, X., Wang, G., Chen, L., Ma, Y., & Wang, Y. (2019) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2019.00086 · Cited by 21
Zhu, X., & Wilhelm, W. E. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.10.012 · Cited by 21
Resource constrained shortest paths and extensions
Garcia, R. (2009) · SMARTech Repository (Georgia Institute of Technology) · Cited by 31
Cost-based Filtering for Shorter Path Constraints
Sellmann, M., Gellermann, T., & Wright, R. C. (2006) · Constraints · doi:10.1007/s10601-006-9006-4 · Cited by 21
The transit time constrained fixed charge multi-commodity network design problem
Hellsten, E. O., Koza, D. F., Contreras, I., Cordeau, J., & Pisinger, D. (2021) · Computers & Operations Research · doi:10.1016/j.cor.2021.105511 · Cited by 22
Engine Scheduling by Column Generation
Lübbecke, M. E. (2001) · Digitale Bibliothek Braunschweig (Verbundzentrale Göttingen (VZG)) · doi:10.24355/dbbs.084-200511080100-720 · Cited by 21
A complementarity equilibrium model for electric vehicles with charging
Bahrami, S., Aashtiani, H. Z., Nourinejad, M., & Roorda, M. J. (2017) · International Journal of Transportation Science and Technology · doi:10.1016/j.ijtst.2017.05.007 · Cited by 16
Shorter Path Constraints for the Resource Constrained Shortest Path Problem
Gellermann, T., Sellmann, M., & Wright, R. W. (2005) · Lecture notes in computer science · doi:10.1007/11493853_16 · Cited by 16
Best upgrade plans for single and multiple source-destination pairs
Lin, Y., & Mouratidis, K. (2014) · GeoInformatica · doi:10.1007/s10707-014-0219-1 · Cited by 15
Xiao, Y., Thulasiraman, K., & Xue, G. (2006) · IEEE Transactions on Computers · doi:10.1109/tc.2006.109 · Cited by 15
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
Camponogara, E., & Shima, R. B. (2020) · doi:10.3217/jucs-016-03-0372 · Cited by 14
Xiao, Y., Thulasiraman, K., & Xue, G. (2005) · Lecture notes in computer science · doi:10.1007/11602613_11 · Cited by 14
Safe Navigation in Urban Environments
Galbrun, E., Pelechrinis, K., & Terzi, E. (2014) · D-Scholarship@Pitt (University of Pittsburgh) · Cited by 12
CNOP - A Package for Constrained Network Optimization
Mehlhorn, K., & Ziegelmann, M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44808-x_2 · Cited by 12
Self-citationXiao, Y., Thulasiraman, K., & Xue, G. (2004) · International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE) · doi:10.1109/qshine.2004.11 · Cited by 12
Data Structures: Time, I/Os, Entropy, Joules!
Ferragina, P. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15781-3_1 · Cited by 11
Routing of Electric Vehicles: Constrained Shortest Path Problems with Resource Recovering Nodes
Merting, S., Schwan, C., & Strehler, M. (2015) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/oasics.atmos.2015.29 · Cited by 11
An experimental study of random knapsack problems
Beier, R., & Vöcking, B. (2006) · Algorithmica · doi:10.1007/s00453-005-1193-7 · Cited by 11
QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks
Wang, L., & Wong, R. C.-W. (2023) · Proceedings of the ACM on Management of Data · doi:10.1145/3589300 · Cited by 10
Zhu, X., & Wilhelm, W. E. (2012) · Computers & Operations Research · doi:10.1016/j.cor.2012.07.007 · Cited by 11
ERCA*: A New Approach for the Resource Constrained Shortest Path Problem
Ren, Z., Rubinstein, Z. B., Smith, S. F., Rathinam, S., & Choset, H. (2023) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2023.3293039 · Cited by 17
A penalty search algorithm for the obstacle neutralization problem
Alkaya, A. F., Aksakallı, V., & Priebe, C. E. (2014) · Computers & Operations Research · doi:10.1016/j.cor.2014.08.013 · Cited by 9
Kou, C., Hu, D., Yuan, J., & Ai, W. (2019) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2019.2955451 · Cited by 12
Farruggia, A., Ferragina, P., Frangioni, A., & Venturini, R. (2013) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973402.115 · Cited by 8
QoS Routing Under Multiple Additive Constraints: A Generalization of the LARAC Algorithm
Xiao, Y., Thulasiraman, K., Xue, G., & Yadav, M. (2015) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2015.2428654 · Cited by 7
Two additive-constrained path selection in the presence of inaccurate state information
Zheng, Y., Korkmaz, T., & Dou, W. (2007) · Computer Communications · doi:10.1016/j.comcom.2007.04.020 · Cited by 7
Fully Realistic Multi-Criteria Timetable Information Systems
Schnee, M. (2009) · Technischen Universität Darmstadt · doi:10.26083/tuprints-00001989 · Cited by 15
Topics in integrated vehicle and crew scheduling in public transport
Steinzen, I. (2007) · Habilitation Regulations of the Faculty of Mechanical Engineering (University of Paderborn) · Cited by 25
Resource Constrained Shortest Paths with a Super Additive Objective Function
Gualandi, S., & Malucelli, F. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33558-7_24 · Cited by 6
Bender, M., Thielen, C., & Westphal, S. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40313-2_14 · Cited by 5
Canadian Traveler Problem with Neutralizations
Yildirim, S., Aksakallı, V., & Alkaya, A. F. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.05.001 · Cited by 5
Efficient Navigation for Constrained Shortest Path with Adaptive Expansion Control
Xia, W., Li, Y., Guo, W., & Li, S. (2022) · Proceedings · doi:10.1109/icdm54844.2022.00069 · Cited by 9
Heuristics for the Canadian traveler problem with neutralizations
Alkaya, A. F., Yildirim, S., & Aksakallı, V. (2021) · Computers & Industrial Engineering · doi:10.1016/j.cie.2021.107488 · Cited by 4
Best Upgrade Plans for Large Road Networks
Lin, Y., & Mouratidis, K. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40235-7_13 · Cited by 4
BER-based Power Scheduling in Wireless Sensor Networks
Zhang, S., Wang, Z., Meikang Qiu, A., & Liu, M. (2013) · Journal of Signal Processing Systems · doi:10.1007/s11265-013-0776-9 · Cited by 4
Solving the constrained shortest path problem using random search strategy
Li, K., Gao, Z., Tang, T., & Yang, L. (2010) · Science China Technological Sciences · doi:10.1007/s11431-010-4105-2 · Cited by 4
A Feasible Path Selection Qos Routing Algorithm With Two Constraints In Packet Switched Networks
Prakash, P. S., & S.Selvan (2008) · doi:10.5281/zenodo.1079851 · Cited by 4
The primal simplex approach to the QoS routing problem
Xiao, Y., Thulasiraman, K., & Xue, G. (2004) · International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE) · doi:10.1109/qshine.2004.51 · Cited by 4
CAD of human resource configuration in project scheduling for construction engineering applications
Lin, J., Shen, P. F., & Lee, B. J. (2018) · Computer Applications in Engineering Education · doi:10.1002/cae.21999 · Cited by 4
Mathematical programming algorithms for reliable routing and robust evacuation problems
Smith, C. J., & Andreas, A. K. (2006) · Cited by 4
Answering Min-Max Resource-Constrained Shortest Path Queries Over Large Graphs
Qian, H., Zheng, W., Zhang, Z., & Fu, B. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2024.3488095 · Cited by 3
A two-stage method for doubly resource constrained elementary shortest path problems
Jin, X., & Yu, S. (2024) · Knowledge-Based Systems · doi:10.1016/j.knosys.2024.111661 · Cited by 4
GIS Based Route Guiding System for Optimal Path Planning in Disaster/Crisis Management
Chandio, A., Shu, P. L. Y., Memon, N. M., & Khawaja, A. (2006) · IEEE International Multitopic Conference (INMIC) · doi:10.1109/inmic.2006.358164 · Cited by 3
A Parallel Algorithm for the Constrained Shortest Path Problem on Lattice Graphs
Matić, I. (2018) · Emergence, complexity and computation · doi:10.1007/978-3-319-77510-4_1 · Cited by 3
PathWyse: a flexible, open-source library for the resource constrained shortest path problem
Salani, M., Basso, S., & Giuffrida, V. (2024) · Optimization methods & software · doi:10.1080/10556788.2023.2296978 · Cited by 13
Frontiers In Operations Research For Overcoming Barriers To Vehicle Electrification
Nejad, M. (2015) · Cited by 2
Innovative Collaborative Task Allocation for UAVs
Karaman, S., Koyuncu, E., & İnalhan, G. (2014) · Springer eBooks · doi:10.1007/978-90-481-9707-1_20 · Cited by 2
A graph algorithm for the time constrained shortest path
Liu, P., & Huang, W. (2022) · Connection Science · doi:10.1080/09540091.2022.2061916 · Cited by 4
Online covering with $$\ell _q$$-norm objectives and applications to network design
Shen, X., & Nagarajan, V. (2019) · Mathematical Programming · doi:10.1007/s10107-019-01409-9 · Cited by 2
An Index Method for the Shortest Path Query on Vertex Subset for the Large Graphs
Pan, Z., Yang, Y., & Hu, Q. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-60259-8_6 · Cited by 1
Salani, M., Basso, S., & Righini, G. (2024) · Transportation research procedia · doi:10.1016/j.trpro.2024.02.046 · Cited by 2
Advances in QoS Path(s) Selection Problem
Thulasiramn, K., Xiao, Y., & Xue, G. (2005) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2005.1464550 · Cited by 1
Metadata
- Authors
- Mehlhorn, K., & Ziegelmann, M.
- Affiliations
- Max Planck Society (DE)
- ORCID
- Mehlhorn, Kurt
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 326-337
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1491580860
- Cited by
- 124
- References
- 15
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 4 · 2023: 3 · 2022: 2 · 2021: 4 · 2020: 4 · 2019: 8 · 2018: 6 · 2017: 5 · 2016: 6 · 2015: 7 · 2014: 7 · 2013: 7 · 2012: 7
- FWCI
- 1.84
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Max Planck Institute for Plasma Physics (submittedVersion)
- MPG.PuRe (Max Planck Society) (submittedVersion)
- Untitled Event
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Social Sciences › Decision Sciences › Management Science and Operations Research › Resource-Constrained Project Scheduling
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods
- Keywords
- resource constraints, linear programming relaxation, combinatorial algorithms, polynomial-time algorithms, exact algorithms, approximation algorithms, NP-completeness
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.