Experimental Algorithms - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642131929, 9783642131936

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Bit-Parallel Search Algorithms for Long Patterns

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-13193-6_12 ◽

2010 ◽

pp. 129-140 ◽

Cited By ~ 10

Author(s):

Branislav Ďurian ◽

Hannu Peltola ◽

Leena Salmela ◽

Jorma Tarhio

Keyword(s):

Search Algorithms ◽

Parallel Search

Download Full-text

Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-13193-6_22 ◽

2010 ◽

pp. 253-265 ◽

Cited By ~ 10

Author(s):

Charles Delort ◽

Olivier Spanjaard

Keyword(s):

Multiobjective Optimization ◽

Knapsack Problem ◽

Bound Sets

Download Full-text

Experiments with a Feasibility Pump Approach for Nonconvex MINLPs

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-13193-6_30 ◽

2010 ◽

pp. 350-360 ◽

Cited By ~ 10

Author(s):

Claudia D’Ambrosio ◽

Antonio Frangioni ◽

Leo Liberti ◽

Andrea Lodi

Keyword(s):

Feasibility Pump

Download Full-text

An Approximate ε-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-13193-6_19 ◽

2010 ◽

pp. 214-225 ◽

Cited By ~ 2

Author(s):

Lucio Grandinetti ◽

Francesca Guerriero ◽

Demetrio Laganà ◽

Ornella Pisacane

Keyword(s):

Arc Routing ◽

Routing Problem ◽

Multi Objective ◽

Capacitated Arc Routing Problem ◽

Constraint Method ◽

Capacitated Arc Routing

Download Full-text

Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-13193-6_35 ◽

2010 ◽

pp. 411-423 ◽

Cited By ~ 17

Author(s):

Md. Mostofa Ali Patwary ◽

Jean Blair ◽

Fredrik Manne

Keyword(s):

Data Structure

Download Full-text

Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-13193-6_31 ◽

2010 ◽

pp. 361-372 ◽

Cited By ~ 1

Author(s):

Amotz Bar-Noy ◽

Panagiotis Cheilaris ◽

Yi Feng

Keyword(s):

Cellular Network ◽

Conference Call ◽

Multiple Users ◽

Yellow Page

Download Full-text

Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-13193-6_23 ◽

2010 ◽

pp. 266-275 ◽

Cited By ~ 2

Author(s):

Edoardo Amaldi ◽

Stefano Coniglio ◽

Stefano Gualandi

Keyword(s):

Cutting Plane

Download Full-text

Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-13193-6_13 ◽

2010 ◽

pp. 141-153 ◽

Cited By ~ 21

Author(s):

Chris Whidden ◽

Robert G. Beiko ◽

Norbert Zeh

Keyword(s):

Fpt Algorithms ◽

Theory And Experiments

Download Full-text

New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-13193-6_24 ◽

2010 ◽

pp. 276-287 ◽

Cited By ~ 9

Author(s):

Anand Subramanian ◽

Eduardo Uchoa ◽

Luiz Satoru Ochi

Keyword(s):

Vehicle Routing ◽

Lower Bounds ◽

Vehicle Routing Problem ◽

Pickup And Delivery ◽

Routing Problem ◽

Simultaneous Pickup And Delivery

Download Full-text

Experimental Study of Resilient Algorithms and Data Structures

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-13193-6_1 ◽

2010 ◽

pp. 1-12 ◽

Cited By ~ 4

Author(s):

Umberto Ferraro-Petrillo ◽

Irene Finocchi ◽

Giuseppe F. Italiano

Keyword(s):

Experimental Study ◽

Data Structures ◽

Algorithms And Data Structures

Download Full-text

Experimental Algorithms - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Bit-Parallel Search Algorithms for Long Patterns

Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem

Experiments with a Feasibility Pump Approach for Nonconvex MINLPs

An Approximate ε-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem

Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure

Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems

Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation

Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments

New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery

Experimental Study of Resilient Algorithms and Data Structures

Experimental Algorithms - Lecture Notes in Computer Science
Latest Publications