Journal: Networks

Found 487 papers in total
Computing cyclic invariants for molecular graphs
Computing cyclic invariants for molecular graphs
2017,
Ring structures in molecules belong to the most important substructures for many...
New upper bound on m-time-relaxed k-broadcast graphs
New upper bound on m-time-relaxed k-broadcast graphs
2017,
Broadcasting is a process in which an individual has an item of information which...
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis
2017,
The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a unifying...
Duality in convex minimum cost flow problems on infinite networks and hypernetworks
Duality in convex minimum cost flow problems on infinite networks and hypernetworks
2017,
Minimum cost flow problems on infinite networks arise, for example, in...
Bounds on the fault-diameter of graphs
Bounds on the fault-diameter of graphs
2017,
Let G be a ( k + 1 ) ‐connected or ( k + 1 )...
A biased-randomized metaheuristic for the vehicle routing problem with clustered and mixed backhauls
A biased-randomized metaheuristic for the vehicle routing problem with clustered and mixed backhauls
2017,
This article analyzes the Vehicle Routing Problem with Backhauls, where delivery and...
Iterated local search for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints
Iterated local search for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints
2017,
In this article an Iterated Local Search algorithm for the capacitated vehicle routing...
On an effective approach for the coach trip with shuttle service problem of the VeRoLog solver challenge 2015
On an effective approach for the coach trip with shuttle service problem of the VeRoLog solver challenge 2015
2017,
The article describes our solution approach for the coach trip with shuttle service...
An iterated beam search algorithm for the green vehicle routing problem
An iterated beam search algorithm for the green vehicle routing problem
2017,
Green, or, alternative‐fuel vehicles provide opportunities to improve fleet...
Full-load route planning for balancing bike sharing systems by logic-based benders decomposition
Full-load route planning for balancing bike sharing systems by logic-based benders decomposition
2017,
Public bike sharing systems require some kind of rebalancing to avoid too many rental...
An adaptive and diversified vehicle routing approach to reducing the security risk of cash-in-transit operations
An adaptive and diversified vehicle routing approach to reducing the security risk of cash-in-transit operations
2017,
We consider the route optimization problem of transporting valuables in...
Partitioning a street network into compact, balanced, and visually appealing routes
Partitioning a street network into compact, balanced, and visually appealing routes
2017,
In practice, it is often desirable for the routes of vehicles to be compact and...
Approaches for finding cohesive subgroups in large-scale social networks via maximum k-plex detection
Approaches for finding cohesive subgroups in large-scale social networks via maximum k-plex detection
2017,
A k‐plex is a clique relaxation introduced in social network analysis to model...
A recursive formula for the two-edge connected and biconnected reliability of a complete graph
A recursive formula for the two-edge connected and biconnected reliability of a complete graph
2017,
The reliability polynomial R ( G , p ) of a finite undirected graph G = ( V , E )...
Two extended formulations for cardinality maximum flow network interdiction problem
Two extended formulations for cardinality maximum flow network interdiction problem
2017,
We consider the maximum flow network interdiction problem in its cardinality case....
Zone-based tariff design in public transportation networks
Zone-based tariff design in public transportation networks
2017,
Tariff design is among the most elementary decision problems to be solved in every...
Hardness and approximation for network flow interdiction
Hardness and approximation for network flow interdiction
2017,
In the Network Flow Interdiction problem, an adversary attacks a network in order to...
The vehicle routing problem with drones: Extended models and connections
The vehicle routing problem with drones: Extended models and connections
2017,
The vehicle routing problem with drones (VRPD) is inspired by the increasing interest...
Branch-cut-price algorithms for solving a class of search problems on general graphs
Branch-cut-price algorithms for solving a class of search problems on general graphs
2017,
We consider graph search problems involving an intruder and mobile searchers. The...
Minimizing the makespan in multiserver network restoration problems
Minimizing the makespan in multiserver network restoration problems
2017,
Suppose that a destroyed network needs to be restored by a number of servers...
An inexact sample average approximation approach for the stochastic connected facility location problem
An inexact sample average approximation approach for the stochastic connected facility location problem
2017,
The sample average approximation (SAA) approach is a widely used technique, based on...
Adaptive large neighborhood search algorithm for the rural postman problem with time windows
Adaptive large neighborhood search algorithm for the rural postman problem with time windows
2017,
The rural postman problem with time windows is the problem of serving some required...
Cancel-and-tighten algorithm for quickest flow problems
Cancel-and-tighten algorithm for quickest flow problems
2017,
Given a directed graph with a capacity and a transit time for each arc and with single...
Bidirected minimum Manhattan network problem
Bidirected minimum Manhattan network problem
2017,
In the bidirected minimum Manhattan network problem, given a set T of n terminals in...
Papers per page: