Highway Dimension and Provably Efficient Shortest Path Algorithms von Abraham, Ittai, Delling, Daniel, Fiat, Amos, Goldberg, Andrew V, Werneck, Renato F

Volltext

Robust branch-and-cut-and-price for the capacitated vehicle routing problem von FUKASAWA, Ricardo, LONGO, Humberto, LYSGAARD, Jens, POGGI DE ARAGAO, Marcus, REIS, Marcelo, UCHOA, Eduardo, WEMECK, Renato F

Volltext

Route Planning in Transportation Networks von Bast, Hannah, Delling, Daniel, Goldberg, Andrew, Müller-Hannemann, Matthias, Pajor, Thomas, Sanders, Peter, Wagner, Dorothea, Werneck, Renato F.

Volltext

Fast local search for the maximum independent set problem von Andrade, Diogo V., Resende, Mauricio G. C., Werneck, Renato F.

Volltext

Round-Based Public Transit Routing von Delling, Daniel, Pajor, Thomas, Werneck, Renato F.

Volltext

Customizable Route Planning in Road Networks von Delling, Daniel, Goldberg, Andrew V., Pajor, Thomas, Werneck, Renato F.

Volltext

Finding near-optimal independent sets at scale von Lamm, Sebastian, Sanders, Peter, Schulz, Christian, Strash, Darren, Werneck, Renato F.

Volltext

A hybrid multistart heuristic for the uncapacitated facility location problem von Resende, Mauricio G.C., Werneck, Renato F.

Volltext

Hierarchical Hub Labelings for Shortest Paths von Abraham, Ittai, Delling, Daniel, Goldberg, Andrew V., Werneck, Renato F.

Volltext

A robust and scalable algorithm for the Steiner problem in graphs von Pajor, Thomas, Uchoa, Eduardo, Werneck, Renato F.

Volltext

A fast swap-based local search procedure for location problems von Resende, Mauricio G. C., Werneck, Renato F.

Volltext

PHAST: Hardware-accelerated shortest path trees von DELLING, Daniel, GOLDBERG, Andrew V, NOWATZYK, Andreas, WERNECK, Renato F

Volltext

Maximum Flows by Incremental Breadth-First Search von Goldberg, Andrew V., Hed, Sagi, Kaplan, Haim, Tarjan, Robert E., Werneck, Renato F.

Volltext

An exact combinatorial algorithm for minimum graph bisection von Delling, Daniel, Fleischman, Daniel, Goldberg, Andrew V., Razenshteyn, Ilya, Werneck, Renato F.

Volltext

A Hybrid Heuristic for the p-Median Problem von Resende, Mauricio G.C., Werneck, Renato F.

Volltext

Robust Distance Queries on Massive Networks von Delling, Daniel, Goldberg, Andrew V., Pajor, Thomas, Werneck, Renato F.

Volltext

Customizable Point-of-Interest Queries in Road Networks von Delling, Daniel, Werneck, Renato F.

Volltext

A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs von Ribeiro, Celso C, Uchoa, Eduardo, Werneck, Renato F

Volltext

Data structures for mergeable trees von Georgiadis, Loukas, Kaplan, Haim, Shafrir, Nira, Tarjan, Robert E., Werneck, Renato F.

Volltext

Finding Dominators in Practice von Georgiadis, Loukas, Werneck, Renato F., Tarjan, Robert E., Triantafyllis, Spyridon, August, David I.

Volltext