yusuke1997/dblp-id-title huggingface dataset:
The generalized diameter of a graph
A polyhedral analysis of the capacitated edge activation problem with uncertain demands
Yield uncertainty and strategic formation of supply chain networks
Minimum gossip bus networks
The clique partitioning problem: Facets and patching facets
Bidirectional A * search on time-dependent road networks
Location of urban micro-consolidation centers to reduce the social cost of last-mile deliveries of cargo: A heuristic approach
Simplifications and speedups of the pseudoflow algorithm
The complexity of finding maximum disjoint paths with length constraints
A mathematical formulation and an LP-based neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem
Parallel iterative search methods for vehicle routing problems
Triconnected decomposition for computing K -terminal network reliability
Constraint programming approaches for the discretizable molecular distance geometry problem
Practical methods of optimization volume 1 : Unconstrained optimization, by R. Flet-cher, Wiley, New York, 1980, 120 pp. Price: $24.50
A branch and cut method for the degree-constrained minimum spanning tree problem
Solving the p-Center problem with Tabu Search and Variable Neighborhood Search
A degree sequence problem related to network design
Data transfers in networks with transceivers
Dynamic multi-sector, multi-instrument financial networks with futures: Modeling and computation
On building minimum cost communication networks over time
Mengerian properties, hamiltonicity, and claw-free graphs
The k best spanning arborescences of a network
Graphical models in applied multivariate statistics, by J. Whittaker, John Wiley & Sons, New York, 1990, 448 pp. Price: $59.95
Mixed planar and network single-facility location problems
Networks and vehicle routing for municipal waste collection
Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks
The Gross-Saccoman conjecture is true
The probabilistic longest path problem
The mixed capacitated general routing problem with time-dependent demands
Graph theory, by W. T. Tutte, Encyclopedia of Mathematics and its Applications, Volume 21, Addison-Wesley Publishing Company, Menlo Park, CA., 1984, 333 pp. Price: 45.00
Route 2005: Recent advances in vehicle routing optimization
Multicommodity flows in simple multistage networks
Edge-vulnerability and mean distance
Timing problems and algorithms: Time decisions for sequences of activities
Weighted k -cardinality trees: Complexity and polyhedral structure
On bilevel minimum and bottleneck spanning tree problems
Cost-effective designs of fault-tolerant access networks in communication systems
The diameter and connectivity of networks with random dependent faults
Reload cost trees and network design
Exact algorithms for solving a Euclidean maximum flow network interdiction problem
Optimality in nonlinear programming: A feasible directions approach, by A. Ben-Israel, A. Ben-Td, and S. Zlobec, Wiley, New York, 1981, 144 pp. Price: $21.95
Linear programming, by Ronald I. Rothenberg, Elsevier North Holland, New York, 1979, 359pp. Price: $24.95
On building minimum cost communication networks
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
Complexity of column generation in network design with path-based survivability mechanisms
Decomposition techniques for the minimum toll revenue problem
A branch-and-price algorithm for switch-box routing
GRASP with path relinking heuristics for the antibandwidth problem
An algorithm for nonlinear multicommodity flow problems
Minimum-cost dynamic flows: The series-parallel case
Cycle prefix digraphs for symmetric interconnection networks
Joint optimization of pricing and resource allocation in competitive telecommunications networks
A Lagrangean relaxation approach to lifetime maximization of directional sensor networks
A note on "Multistage Methods for Freight Train Classification"
Center, median, and centroid subgraphs
Semi-labeled unrooted binary tree optimization subject to nonnegativity
A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
On the construction of balanced switching networks
An exact algorithm for the min-cost network containment problem
Fast algorithms for convex cost flow problems on circles, lines, and trees
Linear and Combinatorial Optimization in Ordered Algebraic Structures, by U. Zimmermann, North-Holland, Amsterdam, 1981, 380 pp. Price: $61.00
Graphs and networks - an introduction by W. L. Price, Auerbach Publishers Inc., 1971
Computational complexity of PERT problems
Shortest paths avoiding forbidden subpaths
A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
On the optional hamiltonian completion problem
Monotonicity and conformality in multicommodity network-flow problems
An iterated local search algorithm for water distribution network design optimization
Cost minimization in wireless networks with a bounded and unbounded number of interfaces
Linear time algorithms for approximating the facility terminal cover problem
The steiner problem in graphs
Cost allocation mechanisms in a peer-to-peer network
The maximum-leaf spanning tree problem: Formulations and facets
Minimax problems with bitonic matrices
Two node-disjoint hop-constrained survivable network design and polyhedra
The parking warden tour problem
Max flow vitality in general and st-planar graphs
The ring grooming problem
Fully dynamic update of arc-flags
A note on the k -degree Cayley graph
Monotone sequences of graphical invariants
On graphs with signed inverses
Real-time scheduling of aircraft arrivals and departures in a terminal maneuvering area
Robust optimization of dynamic route planning in same-day delivery networks with one-time observation of new demand
Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs
Medical diagnosis using influence diagrams
μ-star: An indirect star network
Combinatorial algorithms for inverse network flow problems
An extended formulation for the 1-wheel inequalities of the stable set polytope
A note on the problem of updating shortest paths
A branch-and-cut algorithm for the k -edge connected subgraph problem
The b-bibranching problem: TDI system, packing, and discrete convexity
Connected graph partitioning with aggregated and non-aggregated gap objective functions
A branch-and-cut approach for the least cost influence problem on social networks
Exact and performance-guaranteed multicast algorithms for lifetime optimization in WANETs
Aesthetic considerations for the min-max K-Windy Rural Postman Problem
Reformulation and decomposition approaches for traffic routing in optical networks
Hyper hamiltonian laceability of Cayley graphs generated by transpositions
On the analysis of independent sets via multilevel splitting
Multiterminal resilience for series-parallel networks
The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming
Math-based reinforcement learning for the adaptive budgeted influence maximization problem
Probabilistic analysis of the longest hamiltonian tour problem
Minimum vertex blocker clique problem
Computational development of a lagrangian dual approach for quadratic networks
Minimal-distance routing for KYKLOS II
Network reliability and acyclic orientations
Extensions of labeling algorithms for multi-objective uncertain shortest path problems
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
Preface: Optimization issues in resilient network design and modeling
Edge fault tolerance in graphs
A location model for a facility operating as an M/G/k queue
Novel centrality metrics for studying essentiality in protein-protein interaction networks based on group structures
New large graphs with given degree and diameter six
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques
Measures of vulnerability-the integrity family
A comparison of three algorithms for finding fundamental cycles in a directed graph
Algorithms for a maximum clique and a maximum independent set of a circle graph
Minimum width 2-layer layout of a multichanneled system
Solving the undirected minimum cost flow problem with arbitrary costs
Disconnecting sets in single and two-terminal-pair networks
APPLIED GRAPH THEORY by Clifford W. Marshall, Wiley-Interscience, 1971
The consistent production routing problem
Robust network design: Formulations, valid inequalities, and computations
Approximation bounds for Black Hole Search problems
Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph
Benders decomposition approach for the robust network design problem with flow bifurcations
The load-distance balancing problem
Strongly connected orientations of mixed multigraphs
On the minimum path problem in Knödel graphs
Routing and scheduling for energy and delay minimization in the powerdown model
A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs
An Exact Algorithm for the Hazardous Orienteering Problem
Matchings in 3-vertex-critical graphs: The even case
Complexity of spanning tree problems with leaf-dependent objectives
Reviews in graph theory, edited by William G. Brown, American Mathematical Society, 1980. Volumes I, II, III, IV (paperback)
Optimal permutation routing for low-dimensional hypercubes
Stability of adversarial routing with feedback
Exact and approximate algorithms for optimal network design
Optimal-aim regulation and tracking in large-order nonlinear networks
A procedure for dispatching moving mobile servers
On minimal-node-cost planar embeddings
Projected dynamical systems modeling and computation of spatial network equilibria
Approximation of a batch consolidation problem
Stability of Interdiction Strategies in Quickest Flow Networks
Grocery distribution plans in urban networks with street crossing penalties
Feedback vertex set on cocomparability graphs
Centroidal bases in graphs
Least central subtrees, center, and centroid of a tree
On designing a network to defend against random attacks of radius two
Last-mile delivery with drone and lockers
Minimum-time line broadcast networks
The continuous and discrete path-variance problems on trees
Optimizing robustness in geometric routing via embedding redundancy and regeneration
A new method for constructing minimal broadcast networks
Stability of networks with distributed and nonlinear elements. I
A problem on blocking probabilities in connecting networks
An improved algorithm for the minmax regret median problem on a tree
Some properties of transportation network cooperative games
Linear programming, by Katta G. Murty, John Wiley & Sons, New York, 1983, 482 pp
Strict nonblockingness of reduced shuffle-exchange networks
Shortest path routing and fault-tolerant routing on de Bruijn networks
Double-row planar routing and permutation layout
Conditional connectivity
An algorithm for the longest cycle problem
Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy
Constructions of sparse asymmetric connectors with number theoretic methods
Maximizing SDN resilience to node-targeted attacks through joint optimization of the primary and backup controllers placements
Sharp bounds on the order, size, and stability number of graphs
Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
The single allocation problem in the interacting three-hub network
Robust transshipment problem under consistent flow constraints
Network reliability and the factoring theorem
The Earth is nearly flat: Precise and approximate algorithms for detecting vulnerable regions of networks in the plane and on the sphere
Efficient algorithms for finding 2-medians of a tree
Edge connectivity between nodes and node-subsets
Hamiltonian factorization of the product of a complete graph with itself
Adaptive large variable neighborhood search for a multiperiod vehicle and technician routing problem
Dynamic shortest paths minimizing travel times and costs
How to test a tree
Shortest paths, single origin-destination network design, and associated polyhedra
A compilation of relations between graph invariants - supplement I
Algorithmic approaches to preselective strategies for stochastic scheduling problems
Multiplicative improvements in network reliability bounds
Solving vehicle routing problems with intermediate stops using VRPSolver models
Preface: Emerging challenges in transportation planning
Or on the micro, by David Whitaker, John Wiley and Sons, New York, 1984, 197 pp. Price $19.95
Availability-driven optimal design of shared path protection in WDM networks
Optimal adaptive fault diagnosis for simple multiprocessor systems
Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST)
A fast maximum flow algorithm
A generalized assignment heuristic for vehicle routing
Completely independent spanning trees in torus networks
An Exact-Arithmetic Algorithm for Spanning Tree Modulus
Stochastic shortest path problems with recourse
Network synthesis with few edges
New results for the degree/diameter problem
Network transformations and bounding network reliability
Traffic control and highway networks
A Multi-Trip Vehicle Routing Problem With Release Dates and Interrelated Periods
An iterative two-step heuristic for the parallel drone scheduling traveling salesman problem
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions
A good algorithm for smallest spanning trees with a degree constraint
Computing rooted communication reliability in an almost acyclic digraph
A note on the primal-dual and out-of-kilter algorithms for network optimization problems
Upper and lower bounds for the average-case complexity of path-search
Proportional lot sizing and scheduling: Some extensions
Minimizing a stochastic maximum-reliability path
Finding k shortest simple paths in directed graphs: A node classification algorithm
Integer programming models for detecting graph bipartitions with structural requirements
A composite algorithm for a concave-cost network flow problem
Reductions to 1-matching polyhedra
Dynamic programming algorithms for the conditional covering problem on path and extended star graphs
An efficiently solvable case of the minimum weight equivalent subgraph problem
A graph theory approach for designing conservation reserve networks with minimal fragmentation
Optimum requirement spanning trees and reliability of tree networks
Minimum weight paths in time-dependent networks
An exact bidirectional pulse algorithm for the constrained shortest path
State-space relaxation procedures for the computation of bounds to routing problems
Maximizing spanning trees in almost complete graphs
A random network model of message transmission
Graph labelings derived from models in distributed computing: A complete complexity classification
A routing algorithm for virtual circuit data networks with multiple sessions per O - D pair
k-Broadcasting in trees
A penalized best-response algorithm for nonlinear single-path routing problems
Ernesto de Queirós Vieira Martins (1945-2000): An appreciation
The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms
The Minimum Clique Routing Problem on Cycles
Routing and scheduling of network flows with deadlines and discrete capacity allocation
Most reliable two-terminal graphs with node failures
Unilaterally connected large digraphs and generalized cycles
Minimum cuts and related problems
Grooming for two-period optical networks
On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints
Panconnectivity and edge-pancyclicity of k -ary n -cubes
The prize collecting traveling salesman problem: II. Polyhedral results
Tough enough chordal graphs are Hamiltonian
Computer networks, by Andrew S. Tanenbaum, Prentice-Hall, Englewood Cliffs, New Jersey, 1981, 517 pp. Price: $28.00
The bi-criteria doubly weighted center-median path problem on a tree
Systematic searches for hypohamiltonian graphs
An equi-model matheuristic for the multi-depot ring star problem
Complexity and approximability of the k -way vertex cut
Unambiguous switching link group failure localization in all-optical networks
Location of an obnoxious facility on a network: A voting approach
Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
The power edge set problem
The Gilbert and Pollak conjecture - a generalization
On the number of active nodes in a multicomputer system
Transportation Networks
Historical note on optimum spanning arborescences
On the design of reliable networks
Bounded color functions on graphs
Complete binary trees in folded and enhanced cubes
Star-factors and k-bounded total domination
Decomposition of bipartite graphs under degree constraints
The amount of overtaking in a network of queues
Networks communicating for each pairing of terminals
The early days of Networks
Combining monte carlo estimates and bounds for network reliability
State space partition algorithms for stochastic systems with applications to minimum spanning trees
On edge-disjoint branchings
Deferral strategies for a dynamic communications network
A branch-and-cut approach and alternative formulations for the traveling salesman problem with drone
On the power of BFS to determine a graph's diameter
Integer programming, Constraint programming, and metaheuristic approaches for static optimization of anycast flows in elastic optical networks
Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game
Uniformly-most reliable networks do not always exist
Minimal complete matchings and negative cycles
The facility location problem with general cost functions
An optimal algorithm for the mixed Chinese postman problem
An algorithm for finding a short closed spanning walk in a graph
On the L ( h , k )-labeling of co-comparability graphs and circular-arc graphs
Computing k -shortest path lengths in euclidean networks
Preface: Special issue on Drone Delivery Systems
Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs
Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third-party networks
Sensitivity analysis of 0-1 multiterminal network flows
A Bayesian analysis of simulation algorithms for inference in belief networks
On a leverage problem in the hypercube
The cut property under demand uncertainty
Robust capacity expansion of network flows
Solving large-scale matching problems efficiently: A new primal matching approach
A survey on exact algorithms for the maximum flow and minimum-cost flow problems
Complexity of edge coloring with minimum reload/changeover costs
Multigraph augmentation under biconnectivity and general edge-connectivity requirements
Balanced network flows. V. Cycle-canceling algorithms
On the number of spanning trees in directed circulant graphs
The spectra of wrapped butterfly digraphs
Resilience of partial k -tree networks with edge and node failures
Forwarding indices of consistent routings and their complexity
A continuous-time network simplex algorithm
Minimum linear gossip graphs and maximal linear (Delta, k)-gossip graphs
Secure and efficient routing on nodes, edges, and arcs of simple-graphs and of multi-graphs
Activity selection games and the minimum-cut problem
A new - old algorithm for minimum-cut and maximum-flow in closure graphs
Shortest-path methods: Complexity, interrelations and new propositions
Delivery systems with crowd-sourced drivers: A pickup and delivery problem with transfers
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
Shortest chain subject to side constraints
Complexity of inventory routing problems when routing is easy
Competitive routing in multicast communications
Threshold reliability of networks with small failure sets
A new proximal decomposition algorithm for routing in telecommunication networks
KWIC Index for Computer Networks
Timetabling and assignment problems in railway planning and integer multicommodity flow
Linked local area networks , second edition by Alan J. Mayne, Wiley, 1986, 628 pp., price: $44.95
Minimum cuts, modular functions, and matroid polyhedra
A monte carlo sampling plan for estimating reliability parameters and related functions
Impact of congestion pricing schemes on costs and emissions of commercial fleets in urban areas
An integer linear programming approach to the steiner problem in graphs
Virtual network function reconfiguration in 5G networks: An optimization perspective
Incomplete service and split deliveries in a routing problem with profits
A tabu search with geometry-based sparsification methods for angular traveling salesman problems
The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n-Bonds
New facets for the planar subgraph polytope
On the elimination of negative cost arcs in flow problems
A generating function approach to queueing network analysis of multiprogrammed computers
Radial location theory
Fair dissections of spiders, worms, and caterpillars
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
Data structures and algorithms, by A. Aho, J. Hopcroft, and J. Ullman, Addison-Wesley, Reading, Mass., 1983, 427 pp. Price: $28.85
Path inequalities for the vehicle routing problem with time windows
Generalized networks: Networks embedded on a matroid, part I
Partial characterizations of networks supporting shortest path interval labeling schemes
An empirical validation and data-driven extension of continuum approximation approaches for urban route distances
On the properties of directed switching networks
A compact formulation for the base station deployment problem in wireless networks
Interconnecting networks in the plane: The steiner case
Shared Risk Link Group disjointness and geodiverse routing: A trade-off between benefit and practical effort
Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
The generalized folding-cube network
Approximation Algorithm for the Minimum Interval Partial Multi-Cover Problem
Sequential updating of conditional probabilities on directed graphical structures
A simplex algorithm for minimum-cost network-flow problems in infinite networks
Finding minimum label spanning trees using cross-entropy method
The cyclic method of solving the transshipment problem with an additional linear constraint
Increasing the connectivity of the star graphs
Balanced network flows. I. A unifying framework for design and analysis of matching algorithms
Applications of matching and edge-coloring algorithms to routing in clos networks
Preface to the 2 nd Special Issue on metaheuristics in network optimization
Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
Grid scheduling by on-line rectangle packing
A special spatial equilibrium problem
Cluster fault-tolerant routing in star graphs
The hazardous orienteering problem
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
Competitive analysis for dynamic multiperiod uncapacitated routing problems
Mobile parcel lockers with individual customer service
The k-path vertex cover: General bounds and chordal graphs
Upgrading arcs to minimize the maximum travel time in a network
Distributed delay constrained multicast routing algorithm with efficient fault recovery
Local broadcasting in a tree under minisum criterion
A Resilient Variant of the Ring Star Problem
Combinatorial properties of directed graphs useful in computing network reliability
Editorial: 2016 Glover-Klingman Prize Winners
A comparative study of doubly connected directed topologies for LANs and MANs