Algorithmic results for potential-based flows: Easy and hard cases
来源期刊:NetworksDOI:10.1002/net.21865
Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem
来源期刊:NetworksDOI:10.1002/net.21857
A branch-and-price algorithm for the vehicle routing problem with time windows on a road network
来源期刊:NetworksDOI:10.1002/NET.21852
Algorithms and Complexity of Range Clustering
来源期刊:NetworksDOI:10.1002/net.21854
Evaluation of flow dependent external costs in freight logistics networks
来源期刊:NetworksDOI:10.1002/net.21889
Impact of congestion pricing schemes on costs and emissions of commercial fleets in urban areas
来源期刊:NetworksDOI:10.1002/NET.21872
Anticipation versus reactive reoptimization for dynamic vehicle routing with stochastic requests
来源期刊:NetworksDOI:10.1002/net.21861
Distributionally robust project crashing with partial or no correlation information
来源期刊:NetworksDOI:10.1002/NET.21880
An adaptive large neighborhood search with path relinking for a class of vehicle-routing problems with simultaneous pickup and delivery
来源期刊:NetworksDOI:10.1002/NET.21879
Complexity of edge coloring with minimum reload/changeover costs
来源期刊:NetworksDOI:10.1002/net.21867
The forwarder planning problem in a two-echelon network
来源期刊:NetworksDOI:10.1002/net.21911
Optimizing ground station networks for free space optical communications: Maximizing the data transfer
来源期刊:NetworksDOI:10.1002/net.21859
Bilateral trade with risk-averse intermediary using linear network optimization
来源期刊:NetworksDOI:10.1002/net.21910
Minimum Reload Cost Cycle Cover in Complete Graphs
来源期刊:NetworksDOI:10.1002/NET.21884