Cover Image

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Cheng, Cong-Dian
Format:	Preprint
Published:	2017
Subjects:	Optimization and Control 90C35(Primary), 90C27 (Secondary) G.1.6; G.2.2; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Approximation algorithms for the prize-collecting rural postman problem
by: Li, Hong, et al.
Published: (2026)

Asymmetry in the Complexity of the Multi-Commodity Network Pricing Problem
by: Bui, Quang Minh, et al.
Published: (2022)

A reliability-aware randomized simheuristic for the stochastic team orienteering problem
by: Circelli, Michele
Published: (2026)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part I: Theory
by: Warme, David M.
Published: (2024)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part II: Applications and Computational Evidence
by: Warme, David M.
Published: (2024)

Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
by: Neira, David E. Bernal, et al.
Published: (2021)

An improved approximation algorithm for k-Median
by: Young, Neal E.
Published: (2025)

Nonlinear PageRank Problem for Local Graph Partitioning
by: Kodsi, Costy, et al.
Published: (2024)

Comparative Evaluation of SDP, SOCP, and QC Convex Relaxations for Large-Scale Market-Based AC Optimal Power Flow
by: Keskin, Ata
Published: (2026)

Graph-Coarsening Approach for the Capacitated Vehicle Routing Problem with Time Windows
by: Özyılmaz, Mustafa Mert
Published: (2025)

PRIME: Efficient Algorithm for Token Graph Routing Problem
by: Xu, Haotian, et al.
Published: (2026)

A simple algorithm for the simple bilevel programming (SBP) problem
by: Dempe, Stephan, et al.
Published: (2025)

Quantum walk informed variational algorithm design
by: Matwiejew, Edric, et al.
Published: (2024)

A cutting plane algorithm for globally solving low dimensional k-means clustering problems
by: Ryner, Martin, et al.
Published: (2024)

Optimizing Travel Time and Regenerative Energy for Periodic Timetables
by: Roth, Sarah, et al.
Published: (2026)

Joint Pricing and Matching for Resource Allocation Platforms via Min-cost Flow Problem
by: Hikima, Yuya, et al.
Published: (2024)

Flow Shop Scheduling with Inter-Stage Flexibility and Blocking Constraints
by: Nicosia, Gaia, et al.
Published: (2024)

Unbelievable $O(L^{1.5})$ worst case computational complexity achieved by $spdspds$ algorithm for linear programming problem
by: Halemane, Keshava Prasad
Published: (2014)

Leveraging Analog Neutral Atom Quantum Computers for Diversified Pricing in Hybrid Column Generation Frameworks
by: Perron, Cédrick, et al.
Published: (2025)

On the Number of Degenerate Simplex Pivots
by: Kukharenko, Kirill, et al.
Published: (2023)

Rich Vehicle Routing Problem in Disaster Management enabling Temporally-causal Transhipments across Multi-Modal Transportation Network
by: Banerjee, Santanu, et al.
Published: (2025)

Pseudoconvex Problems in Operational Decision Systems: Algorithms for Joint Learning and Optimization
by: Li, Zijun, et al.
Published: (2026)

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
by: Ali, Alejandro Mata
Published: (2025)

Semi-Supervised Clustering of Sparse Graphs: Crossing the Information-Theoretic Threshold
by: Sheng, Junda, et al.
Published: (2022)

Using Variable Interaction Graphs to Improve Particle Swarm Optimization
by: Czworkowski, Caz L., et al.
Published: (2025)

A unified worst case for classical simplex and policy iteration pivot rules
by: Disser, Yann, et al.
Published: (2023)

A Riemannian Variational and Spectral Framework for High-Dimensional Sphere Packing: Barrier-Dynamics Reconciliation, Periodic Rigidity, and Discrete-Time Guarantees
by: Alpay, Faruk, et al.
Published: (2025)

Computational Phase Transitions in Binary Compressed Sensing: Quantum Annealing Inside the Relaxation Gap
by: Hahn, William, et al.
Published: (2026)

Hybrid LLM and Higher-Order Quantum Approximate Optimization for CSA Collateral Management
by: Jin, Tao, et al.
Published: (2025)

Measuring diversity. A review and an empirical analysis
by: Parreño, Francisco, et al.
Published: (2024)

A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming
by: Fu, Wenhao, et al.
Published: (2023)

Modern column generation for estimating single- and multi-purchase ranked list choice models
by: Costa, Luciano, et al.
Published: (2026)

Random-key genetic algorithms: Principles and applications
by: Londe, Mariana A., et al.
Published: (2025)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
by: Emmerich, Michael T. M.
Published: (2026)

Benders Cut Filtering for Affine Potential-Based Flow Problems with Robustness Scenarios and Topology Switching
by: Donkiewicz, Tim, et al.
Published: (2026)

Simultaneous recovery of a sparse topology and the admittance of an electrical network
by: Samperio, Álvaro
Published: (2023)

Socio-cognitive agent-oriented evolutionary algorithm with trust-based optimization
by: Urbańczyk, Aleksandra, et al.
Published: (2025)

Ethic Duality: A Homological Framework for Primal-Dual Problems
by: Pasechnyuk-Vilensky, Dmitry, et al.
Published: (2025)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
by: Chimani, Markus, et al.
Published: (2021)

Multi-objective Integer Linear Programming approach for Automatic Software Cognitive Complexity Reduction
by: Novoa-Hurtado, Adriana, et al.
Published: (2026)