yusuke1997/dblp-id-title huggingface dataset:
Distance-layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing
Probabilistic partitioning algorithms for the rectilinear steiner problem
Complexity of network reliability computations
Integer flows in network with fuzzy capacity constraints
Multiterminal Path Flows for Packet-Switching Communication Networks
On a property of cyclic covers of p -graphs
Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network
Synthesis of directed multicommodity flow networks
An airline tail routing algorithm for periodic schedules
On the chromatic number of disk graphs
Networks immune to isolated line failures
Optimally reliable graphs for both edge and vertex failures
APPRECIATION TO REFEREES
Cutsets and partitions of hypergraphs
Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem
Optimal ranking of tournaments
On cycle bases of a graph
Algorithms to calculate the distribution of the longest path length of a stochastic activity network with continuous activity durations
A branch & cut algorithm for the windy general routing problem and special cases
Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows
The design and analysis of heuristics
The tree center problems and the relationship with the bottleneck knapsack problems
(K, j)-domination and (K, j)-reliability
An extended planar algorithm for maximum integral two-flow
Editorial: 2008 Glover-Klingman prize winners
Monte Carlo and Markov Chain techniques for network reliability and sampling
Efficient algorithms for the maximum concurrent flow problem
Min-sum controllable risk problems with concave risk functions of the same value range
The price of anarchy in nonatomic consumption-relevance congestion games
Minimal k-arc connected graphs
The structure of max lambda-min m+1 graphs used in the design of reliable networks
Guest editorial: Recent trends in vehicle routing
Improving reliability bounds in computer networks
Constructing a minimal-cost spanning tree subject to resource constraints and flow requirements
A boolean theory of network flows and metrics and its applications to particle transmission and clustering
Gossiping and routing in undirected triple-loop networks
On the performance and feasibility of multicast core selection heuristics
Further contributions to network optimization
Minimax regret path location on trees
A more compact formulation of the symmetric multiple traveling salesman problem with fixed charges
Computer networks and distributed processing, by James Martin, Prentice-Hall, Englewood Cliffs, NJ, 1981, 562 pp. Price: $34.00
A network decomposition/aggregation procedure for a class of multicommodity transportation problems
A decomposition approach to solve the selective graph coloring problem in some perfect graph families
On the complexity of the upgrading version of the maximal covering location problem
Avoiding Deadlocks via Weak Deadlock Sets
Impact of topographic information on graph exploration efficiency
Transitively reduced and transitively closed event networks
On the nonexistence of uniformly optimal graphs for pair-connected reliability
On the construction of combined k-fault-tolerant Hamiltonian graphs
On kernels in strongly connected graphs
Algorithms for Network Programming, by J. L. Kennington and R. V. Helgason, Wiley, New York, 1980, 291 pp. Price: $25.00
Inflection points of reliability polynomials are dense in [0, 1]
Counting small cycles in generalized de Bruijn digraphs
An O(N 2 ) heuristic for steiner minimal trees in E 3
A probabilistic model of learning by means of problems
The art of computer systems performance analysis, by R. Jain, John Wiley & Sons. New York, 1991, 685 pp
Cost allocation in networks: The bulk supplier problem
Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956-1974)
Finding integer efficient solutions for multiple objective network programming problems
Reduction tests for the steiner problem in grapsh
Dynamic shortest-path interdiction
Simulation methodology for statisticians, operations analysts and engineers, Vol. I, by P. A. W. Lewis and E. J. Orav, Wadsworth, Belmont, CA, 1989, 416 pp
The maximum independent set problem for cubic planar graphs
A biased-randomized metaheuristic for the vehicle routing problem with clustered and mixed backhauls
Solving the undirected multicommodity flow problem using a shortest path-based pricing algorithm
The invisible-hand heuristic for origin-destination integer multicommodity network flows
Graphs with given connectivity properties
Stochastic shortest paths with recourse
Neighborhood conditions for graphs to be super restricted edge connected
Capacitated arc routing problems
Computing near-optimal solutions to the steiner problem in a graph using a genetic algorithm
Traffic grooming in bidirectional WDM ring networks
Improvement on vertex cover for low-degree graphs
Editorial: 2013 Glover-Klingman Prize winners
Construction of large-size interconnection networks with high performance
Routing in quasi torus networks
A new concept of primeness in graphs
Robust reconstruction of Barabási-Albert networks in the broadcast congested clique model
A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
Sales-delivery man problems on treelike networks
A Hit-and-Run approach for generating scale invariant Small World networks
Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
Verification of DAG structures in cooperative belief network-based multiagent systems
A polynomial algorithm for minimizing travel time in consistent time-dependent networks with waits
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
Combinatorial optimization and vehicle fleet planning: Perspectives and prospects
Cyclic gossiping times for some classes of graphs
Network models for maximization of heat transfer under weight constraints
Two-way traffic in loop service systems
Convexity and the Steiner tree problem
An exact lower bound on the number of cut-sets in multigraphs
A branch and bound algorithm for the capacitated minimum spanning tree problem
Minimum path bases and relevant paths
The Early Days of Networks
A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems
Small congestion embedding of graphs into hypercubes
Unimodular matrices of flow problems with additional constraints
Editorial: 2018 Glover-Klingman Prize Winners
Exact methods based on node-routing formulations for undirected arc-routing problems
An analysis of alternative strategies for implementing matching algorithms
Reliable broadcast protocols in unreliable networks
Tools for studying paths and cycles in digraphs
Resilience of communication networks to random failures and disasters: An optimization perspective
Analysis of a flow problem with fixed charges
Steiner trees, connected domination and strongly chordal graphs
On the cycle polytope of a directed graph and its relaxations
Dynamic programming approaches for the traveling salesman problem with drone
Edge-superconnectivity of cages
Reliable distributed diagnosis for multiprocessor systems with random faults
Same-day delivery with heterogeneous fleets of drones and vehicles
Minimal disconnected cuts in planar graphs
Mixed-Integer Linear Programming Approaches for Nested p$$ p $$-Center Problems With Absolute and Relative Regret Objectives
Risk-averse optimization and resilient network flows
Modeling K-coteries by well-covered graphs
An adaptive discretization algorithm for a class of continuous network programs
The Minimum-Cost Dynamic Flow Problem in a Fixed Graph With a Constant Target Flow Value
Average properties of two-dimensional partial orders
Graphs, branchwidth, and tangles! Oh my!
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs
The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
Tolerant identification with Euclidean balls
Solution properties of oligopolistic network equilibria
Efficient parallel algorithms for bipartite permutation graphs
Graph orientation and flows over time
On the p-median polytope and the odd directed cycle inequalities: Oriented graphs
Reductions for the rectilinear steiner tree problem
Design of Survivable Networks: A survey
Domination theory and the crapo β-invariant
An algebra of bayesian belief universes for knowledge-based systems
Imbalances in k-colorations
Shortest paths with euclidean distances: An explanatory model
On Steiner centers and Steiner medians of graphs
Packing returning secretaries
Linear-time algorithms for the 2-connected steiner subgraph problem on special classes of graphs
Strong formulations for network design problems with connectivity requirements
An exact algorithm for the service network design problem with hub capacity constraints
Independent sets in random sparse graphs
Computation of the optimal value function in time-dependent networks
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
Exact Methods for the Split Delivery Vehicle Routing Problem With Two-Dimensional Loading Constraints
The inventory routing problem with split deliveries
An extremal problem on the connectivity of graphs
The Robust Vehicle Routing Problem With Synchronization: Models and Branch-And-Cut Algorithms
On a parametric shortest path problem from primal - dual multicommodity network optimization
Communications network analysis, by Howard Cravis, Lexington Books, Lexington, MA, 1981, 144pp. Price not given
A new linear path pair availability constraint for network design
A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem
On the np-completeness of certain network testing problems
A characterization of 3-Steiner distance hereditary graphs
Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs
Optimal edge-coloring with edge rate constraints
A lower bound for the steiner tree problem in directed graphs
Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem
Solving the asymmetric traveling salesman problem with periodic constraints
Fast reliability ranking of matchstick minimal networks
Optimal tree 3-spanners in directed path graphs
Partial orders of dimension 2
Reliability analysis of circulant graphs
A solution approach for multi-trip vehicle routing problems with time windows, fleet sizing, and depot location
Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers
Capacity expansion - analysis of simple models with applications, by John Freidenfels, North Holland, 1981, 291 pp. Price: $39.50
The complexity of the timetable-based railway network design problem
Dissimilar arc routing problems
On undirected two-commodity integral flow, disjoint paths and strict terminal connection problems
Capacitated network design games with weighted players
A randomized algorithm for gossiping in radio networks
Improving a constructive heuristic for the general routing problem
Independence properties of directed markov fields
On balance in group graphs
Succinct greedy drawings do not always exist
Shortest path network interdiction with asymmetric uncertainty
A note on Steiner tree games
Constrained optimization and Lagrange multiplier methods, by D. P. Bertsekas, Academic Press, New York, 1982, 395 pp. Price: $65.00
Advanced linear programming: Computation and practice, by Bruce A. Murtagh, McGraw-Hill, New York, 1981, 202 pp. Price: $39.50
A practical and robust approach for solving the multi-compartment vehicle routing problem under demand uncertainty using machine learning
Constructing a bipartite graph of maximum connectivity with prescribed degrees
A mathematical analysis of the R-MAT random graph generator
Optimal deployment of indoor wireless local area networks
A reliability-improving graph transformation with applications to network reliability
The minimax multistop location problem on a tree
Analysis of an exact algorithm for the vessel speed optimization problem
Two new mixed-integer programming models for the integrated train formation and shipment path optimization problem
Generalizations of planar graphs
On the minimum number of wavelengths in multicast trees in WDM networks
On the memory overhead of distributed snapshots
An improved heuristic for the period vehicle routing problem
Distributionally robust project crashing with partial or no correlation information
Formulation and structure of more complex/realistic routing and scheduling problems
Finding all minimum-cost perfect matchings in Bipartite graphs
A compilation of relations between graph invariants
Optimal pricing of capacitated networks
Accelerated branch exchange heuristics for symmetric traveling salesman problems
Picking Operations in Warehouses With Dynamically Arriving Orders: How Good is Reoptimization?
Algorithms for minimum-cost paths in time-dependent networks with waiting policies
Graph folding and programmable logic array
Critical arcs detection in influence networks
Flows on few paths: Algorithms and lower bounds
Lifting and separation of robust cover inequalities
Note: The diameter of edge domination critical graphs
A GRASP with path-relinking for private virtual circuit routing
Minimal feedback vertex sets in directed split-stars
Flow-dependent networks: Existence and behavior at Steiner points
Computer communication network design: Experience with theory and practice
Equivalence of buddy networks with arbitrary number of stages
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles
Algorithms for K-terminal reliability problems with node failures
A bit-pushing shortest distance algorithm
Introduction to queueing theory, 2nd ed., by Robert B. Cooper, Elsevier North Holland, New York, 1981, 347 pp. Price: $24.95
Optimal broadcasting with universal lists based on competitive analysis
Optimal and heuristic network coding algorithms for multi-layered video broadcast
Min-Max quickest path problems
An exact algorithm for the asymmetrical capacitated vehicle routing problem
Incorporating Fairness Into the Gateway-Based Risk Mitigation Policy for Hazmat Transport
The Rainbow Cycle Cover Problem
Bond graphs for modeling engineering systems, by A. J. Blundell, Halstead, Ellis Horwood Limited, London, 1982, 151 pp. Price: $44.95
On a stochastic bilevel programming problem
Evaluation of flow dependent external costs in freight logistics networks
An ejection chain algorithm for the quadratic assignment problem
A polyhedral study of the network pricing problem with connected toll arcs
On optimal orientations of Cartesian products of even cycles
Network flow programming, by P. A. Jensen and J. W. Barnes, John Wiley and Sons, Inc., New York, 1980, 408 pp. Price: $28.95
A two-stage vehicle routing model for large-scale bioterrorism emergencies
Light graphs with small routing cost
The local Steiner problem in normed planes
A modified Melzak procedure for computing node-weighted Steiner trees
Deadlock-free interval routing schemes
Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
Introduction to graph theory
Minimum cost routing for dynamic network models
A new method for efficient symbolic propagation in discrete Bayesian networks
Path problems in networks with vector-valued edge weights
The graph Voronoi diagram with applications
On diameter of permutation graphs
Finding a manhattan path and related problems
Consistency and satisfiability of waveform timing specifications
A characterization of the two-commodity network design problem
An explicit construction of Euler circuits in shuffle nets and related networks
A combinatorial branch and bound for the safe set problem
A simple protocol for deniable authentication based on ElGamal cryptography
Drone arc routing problems
On reliability evaluation of a capacitated-flow network in terms of minimal pathsets
Link-disjoint embedding of complete binary trees in meshes
Optimal response to epidemics and cyber attacks in networks
Growth and Development, Ecosystems Phenomenology by Robert E. Ulanowicz, springer-Verlag, New York, 1986, 178 pp
All-port line broadcasting in highly connected graphs
Some comments on permutation layout
The stochastic critical node problem over trees
On locating path- or tree-shaped facilities on networks
The generalized P -forest problem on a tree network
Dual algorithms for the shortest path tree problem
The minimum evolution problem: Overview and classification
The status of cable television network design
The k -degree Cayley graph and its topological properties
Optimum Steiner ratio for gradient-constrained networks connecting three points in 3-space, part I
Sharper analysis of packet routing on a butterfly
Preprocessing for segment routing optimization
A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem
Virtual function placement for service chaining with partial orders and anti-affinity rules
Circuit-switched row-column broadcasting in torus and mesh networks
Survivability in hierarchical telecommunications networks
Navigating free-floating minefields via time-varying Voronoi graphs
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
Application of semi definite relaxation and variable neighborhood search for multiuser detection in synchronous CDMA
Minimum order graphs with specified diameter, connectivity, and regularity
On uniformly optimally reliable graphs for pair-connected reliability with vertex failures
A real-life study on the value of integrated optimization in order picking operations under dynamic order arrivals
On mean distance in certain classes of graphs
An advanced dual incremental network algorithm
Shortest-path algorithms: Taxonomy and annotation
Power domination in cylinders, tori, and generalized Petersen graphs
Parametrized relocation of low-mobility resources
Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem
A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
On truncated-newton methods for solving the spatial price equilibrium problem
Integer programming models and algorithms for the graph decontamination problem with mobile agents
Bounding procedures for multistage stochastic dynamic networks
Bounding vertex coloring by truncated multistage branch and bound
A note on finding shortest path trees
Variable neighborhood search approach with intensified shake for monitor placement
A computationally efficient method for nonlinear multicommodity network flow problems
Shortest path with time constraints on movement and parking
Efficient algorithms for finding the (k, l)-core of tree networks
Deferred-query: An efficient approach for some problems on interval graphs
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks
The vertex-face total chromatic number of Halin graphs
Sequencing and scheduling-an introduction to the mathematics of the job-shop, by Simon French, Wiley, 1982, 245 pp. Price: $49.95
Digraphs with maximum number of paths and cycles
Hide-and-seek games on a tree to which Eulerian networks are attached
Linear edge costs and labeling algorithms: The case of the time-dependent vehicle routing problem with time windows
Forty years of periodic vehicle routing
Preface: Special issue on arc routing problems and other related topics
Special issue of Networks: New network models and approaches for logistics and transportation
Vehicle routing problems with road-network information: State of the art
TRAFFIC SCIENCE
The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search
Construction of efficient tree networks: The pipeline problem
Optimizing Connected Components Graph Partitioning With Minimum Size Constraints Using Integer Programming and Spectral Clustering Techniques
The capacitated arc routing problem with intermediate facilities
An approximation scheme for some Steiner tree problems in the plane
On finding steiner vertices
Optimal connected subgraphs: Integer programming formulations and polyhedra
Packing cuts in undirected graphs
Valid inequalities and facets for multi-module survivable network design problem
Metaheuristics for the vehicle routing problem with loading constraints
Heuristic solutions for general concave minimum cost network flow problems
Plowing with precedence in polynomial time
Doubly-rooted stem-and-cycle ejection chain algorithm for the asymmetric traveling salesman problem
On digraphs with a rooted tree structure
Communications networks: A first course, by Jean Walrand, Irwin Inc. and Aksen Associates, Homewood, IL, 1991, 460 pp. Price: $52.95
Grid spanners
Degree-five Steiner points cannot reduce network costs for planar sets
On the adjacency properties of paley graphs
Future directions in drone routing research
Investing in arcs in a network to maximize the expected max flow
Algorithmic graph theory and perfect graphs, by Martin C. Golumbic, Academic, New York, 284 pp. Price: $34.00
Conditional graph connectivity relative to hereditary properties
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
A matheuristic algorithm for the mixed capacitated general routing problem
Distributed tree comparison with nodes of limited memory
On approximate data reduction for the Rural Postman Problem: Theory and experiments
Two exact algorithms for the distance-constrained vehicle routing problem
Compression and expansion in graphs using overlays
The determination of the path with minimum-cost norm value
On a condition for obtaining an explicit solution of optimum requirement spanning tree
An assignment routing problem
Approximability of unsplittable shortest path routing problems
Improving the location of minimax facilities through network modification
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees
Multiperiod network design with incremental routing
Topological network design of state-dependent queueing networks
On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
Maximum likelihood genetic sequence reconstruction from oligo content
Two extended formulations for cardinality maximum flow network interdiction problem
The stochastic time-cost tradeoff problem: A robust optimization approach
On the construction of optimally reliable graphs
Dynamic matchings and quasidynamic fractional matchings. I
The tolerance approach to sensitivity analysis in network linear programming
Bounding all-terminal reliability in computer networks
Embedding longest fault-free paths in arrangement graphs with faulty vertices
Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
The prize collecting traveling salesman problem
The multi-commodity pickup-and-delivery traveling salesman problem
Color-feasible sequences of a multigraph
Modeling and optimal control of congested transportation systems
A note on Arc tolerances in sparse shortest-path and network flow problems
On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North - South Streets
Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems
A polynomial algorithm for the p-centdian problem on a tree
On the edge-connectivity vector of a graph
Scheduling in broadcast networks
The traveling salesman problem , edited by E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B Shmoys, John Wiley & Sons, Chichester, 1985, 463 pp
Connectedness of digraphs and graphs under constraints on the conditional diameter
A note on the online nature of the railway delay management problem