yusuke1997/dblp-id-title huggingface dataset:
Measures of the restrictiveness of project networks
Some new large (delta, 3)-graphs
Optimal routing with failure-independent path protection
Maximal expected flow in a network subject to arc failures
On persistent directed graphs
Reserving resilient capacity for a single commodity with upper-bound constraints
Progressive hedging-based metaheuristics for stochastic network design
The stochastic close-enough arc routing problem
Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle problem
The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
Robust network function virtualization
Min-Max K -vehicles windy rural postman problem
On extended formulations for the precedence constrained asymmetric traveling salesman problem
New lower bounds for the Capacitated Arc Routing Problem
A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem
Repeated uncoordinated information dissemination by flooding
Solving the hub location problem in a star-star network
Route discovery with constant memory in oriented planar geometric networks
Source-limited inclusive routing: A new paradigm for multicast communication
Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment
The full-degree spanning tree problem
Deception tactics for network interdiction: A multiobjective approach
Reliability polynomials of consecutive- k -out-of- n : F systems have unbounded roots
Decomposition algorithms for solving the minimum weight maximal matching problem
The multiple vehicle balancing problem
Vulnerability of scheduled networks and a generalization of Menger's Theorem
A dynamic programming algorithm for order picking in robotic mobile fulfillment systems
All-to-all communication for some wavelength-routed all-optical networks
How to find a battleship
On the multiway cut polyhedron
Maximum flow-based formulation for the optimal location of electric vehicle charging stations
Minimizing maximum flows in linear graphs
A two-stage network with dual partial concentrators
A metaheuristic algorithm for large maximum weight independent set problems
Insertion heuristics for central cycle problems
A Note on the Largest Insertion Algorithm for the Traveling Salesman Problem
Critical nodes for distance-based connectivity and related problems in graphs
A survey of heuristics for the weighted matching problem
Three network design problems for community energy storage
The policy graph decomposition of multistage stochastic programming problems
Some theoretical results in multiple path definition in networks
Braess' paradox: A cooperative game-theoretic point of view
Four-terminus flows
The linear arrangement problem on recursively constructed graphs
On the unilateral (Delta, D*)-problem
On large (Δ, D , D , 1)-graphs
Public congestion network situations and related games
Network properties of the ARPA computer network
Exact cuts in networks
Minimizing the cost of placing and sizing wavelength division multiplexing and optical crossconnect equipment in a telecommunications network
Max-min partitioning of grid graphs into connected components
Operations Research Support Methodology, Albert G. Holzman, Ed., Marcel Dekker, New York, 1979, 648 pp. Price $39.75
An iterated local search for a multi-period orienteering problem arising in a car patrolling application
Discrete computational structures, second edition, By Robert R. Korfhage, Academic Press, Inc., Orlando, FI, 1984, 360 pp. Price $35.00
Updating routing tables after resource failure in a distributed computer network
The Push Tree problem
On LP relaxations for the pattern minimization problem
Algorithmic results for potential-based flows: Easy and hard cases
Traffic flows on transportation networks, by G. F. Newell, MIT Press, 1980, 276 pp. Price: $30.00
Bounds on the radius and status of graphs
Shortest path problems with node failures
Linear and combinatorial programming. By Katta G. Murty, John Wiley &Sons, Inc., New York, N.Y. 1976, $21.00, 567 pages
A branch-and-cut algorithm for a bipartite graph construction problem in digital communication systems
A three-stage p-median based exact method for the optimal diversity management problem
Computational experience with a SDP-based algorithm for maximum cut with limited unbalance
The Rural Postman Problem with time windows
A multicommodity flow problem
Availability-based path selection and network vulnerability assessment
A branch and bound algorithm for the multiple depot vehicle scheduling problem
The bottleneck selected-internal and partial terminal Steiner tree problems
Retracted: A novel pseudo-polynomial approach for shortest paths problems
A maritime inventory routing problem: Discrete time formulations and valid inequalities
On non-blocking switching networks
Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing
Dilation-free graphs in the l 1 metric
Minimum-weight subgraphs with unicyclic components and a lower-bounded girth
Modular decomposition and reliability computation in stochastic transportation networks having cutnodes
Operations management: Strategy and analysis, by Lee J. Krajewski and L. P. Ritzman, Addison-Wesley, Reading, MA, 1987, 916 pp., Price: $43.95
Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs
Maximum degree in graphs of diameter 2
The general multimodal network equilibrium problem with elastic demand
A stochastic inventory routing problem for infectious medical waste collection
Mathematical aspects of scheduling and applications, by R. Bellman, A. O. Esogbue, and I. Nabeshima, Pergamon, London, 1982, 329 pp. Price: $19.50
Augmented cubes
Efficient presolving methods for the influence maximization problem
Solving the two-facility network design problem with 3-partition facets
Adaptive large neighborhood search algorithm for the rural postman problem with time windows
Approximation algorithms for the k-source multicast tree construction problem
A multi-vehicle covering tour problem with speed optimization
Cardinality constrained path covering problems in grid graphs
Disjoint paths in a network
Congestion-free, dilation-2 embedding of complete binary trees into star graphs
The computational complexity of graph contractions II: Two tough polynomially solvable cases
Factorization and exact evaluation of the source-terminal diameter-constrained reliability
Efficient algorithms for computing the reliability of permutation and interval graphs
The Ring Star Problem: Polyhedral analysis and exact algorithm
A decomposition algorithm for locating a shortest path between two nodes in a network
Generalized measures for fault tolerance of star networks
An improved approximation scheme for the Group Steiner Problem
Probabilistic analysis of an lp relaxation bound for the steiner problem in networks
A statistical approach to the tsp
Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O( log(n2/m)/log n) bound for the nonbipartite cardinality matching problem
A numerical tool for multiattribute ranking problems
Applications and efficient algorithms for integer programming problems on monotone constraints
Routing electric vehicles with a single recharge per route
Construction of centered shortest-path trees in networks
Circuit partitioning with size and connection constraints
Editorial: 2007 Glover-Klingman Prize winners
Bipartite regular graphs with fixed diameter
Polyhedral structure of the 4-node network design problem
The period routing problem
A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
Multiple message broadcasting in the postal model
Locating mobile servers on a network with markovian properties
Locating replicas of a database on a network
A new consistent vehicle routing problem for the transportation of people with disabilities
Nonlinear programming: Theory, algorithms, and applications by G. P. McCormick, Wiley, New York, 1983, 444 pp. Price: $48.50
ROUTE 2007: Recent advances in vehicle routing optimization
The firebreak problem
Balancing large social accounting matrices with nonlinear network programming
Low-connectivity network design on series-parallel graphs
Optimal I -Intersection assignments for graphs: A linear programming approach
Complexity of a classical flow restoration problem
Leonhard Euler: A brief appreciation
Shortest paths in stochastic networks with ARC lengths having discrete distributions
The 1-minimax and 1-maximin problems with demand weights of general probability distributions
An optimization approach for congestion control in network routing with quality of service requirements
Counting k -component forests of a graph
Minimal selectors and fault tolerant networks
Computing capacitated minimal spanning trees efficiently
Multi-budgeted matching problems
Network optimization in supply chain management and financial engineering: An annotated bibliography
Obtaining online approximation algorithms for facility dispersion from offline algorithms
Use of continuous approximations within discrete algorithms for routing vehicles: Experimental results and interpretation
Circular permutation graphs
Line planning, path constrained network flow and inapproximability
Partitioning a street network into compact, balanced, and visually appealing routes
A polyhedral study of the asymmetric traveling salesman problem with time windows
Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
Degree- and time-constrained broadcast networks
A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments
A flow-dependent quadratic steiner tree problem in the Euclidean plane
Series-parallel reduction for difficult measures of network reliability
The traveling salesman problem with pickup, delivery, and ride-time constraints
A Rolling Horizon Heuristic for the Multiperiod Network Design and Routing Problem
Modeling and solving a multimodal transportation problem with flexible-time and scheduled services
Network flow methods for electoral systems
On Combining Conventional Point-To-Point and Automated Waste Collection Systems
Approximability of the k -server disconnection problem
Preface: Theoretical and algorithmic contributions to network optimization problems
Getting linear time in graphs of bounded neighborhood diversity
A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
The cost of incentive compatibility in auction-based mechanisms for carrier collaboration
Time-dependent traveling salesman problem-the deliveryman case
An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem
A new approach to near-optimal path assignment through electric-circuit modeling
The bridges of Königsberg - A historical perspective
Linear placement algorithms and applications to VLSI design
Learning to repeatedly solve routing problems
Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization
Optimal grid representations
Problems in the design of large power networks
Rainbow trees in graphs and generalized connectivity
Minimal ratio spanning trees
The most likely path on series-parallel networks
Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
Location of facilities on a network subject to a single-edge failure
Shortest alternating path algorithms
On general routing problems: Comments
An approximation algorithm for the Steiner connectivity problem
A survivable variant of the ring star problem
A unidirectional ring partition problem
Optimal vehicle routing with lower and upper bounds on route durations
On computing the connectivities of graphs and digraphs
A survey of gossiping and broadcasting in communication networks
Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems
Component-level redundancy is better than system-level redundancy for channel graphs
A disjunctive program formulation to generate regular public transit timetables adhering to prioritized planning requirements
An Improved Freight Transportation Planning System for Less-Than-Truckload Operations of a Third-Party Logistics Carrier
Lower bounds for two-period grooming via linear programming duality
On building multiple spanning trees and VLAN assignment in metro ethernet networks
A polynomial algorithm for a constrained traveling salesman problem
Routing in computer networks
The SONET edge-partition problem
The balanced billing cycle vehicle routing problem
A linear programming based approach to the Steiner tree problem with a fixed number of terminals
On the bisection width of the transposition network
On a routing and scheduling problem concerning multiple edge traversals in graphs
A two-level local search heuristic for pickup and delivery problems in express freight trucking
An exact method for a class of robust shortest path problems with scenarios
An implicit enumeration scheme for the batch selection problem
A MIP-based local search method for the railway rescheduling problem
Substitutes, complements, and ripples in multicommodity flows on suspension graphs
Worst-case ratios of networks in the rectilinear plane
An improved hybrid genetic search with data mining for the CVRP
Dual-failure restorability analysis of span-restorable meta-mesh networks
A multistart heuristic for the equality generalized traveling salesman problem
On stochastic programs over trees with partially dependent arc capacities
On the relationship between Nash - Cournot and Wardrop equilibria
A heuristic algorithm for a network problem with variable upper bounds
On totally unimodular matrices
The most vital edges of matching in a bipartite graph
Tighter time bounds on fault-tolerant broadcasting and gossiping
Algorithmic solutions for maximizing shareable costs
The capacity formulation of the capacitated edge activation problem
Time bounds on fault-tolerant broadcasting
Euclidean shortest paths in the presence of rectilinear barriers
Rectangular duals of planar graphs
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
Restricted delivery problems on a network
Probabilistic analysis of divide-and-conquer heuristics for minimum weighted euclidean matching
On optimum path problems
Reaching the elementary lower bound in the vehicle routing problem with time windows
Changing careers in science and engineering edited by Sanborn C. Brown, MIT Press, 1972, 349 pages
The complexity of minimum cut and maximum flow problems in an acyclic network
The time-dependent quickest path problem: Properties and bounds
Rational roots of all-terminal reliability
Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers
Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs
Reducing the Steiner problem in four uniform orientations
Optimal consecutive-2 systems of lines and cycles
Decision support for the technician routing and scheduling problem
Cutting planes for branch-and-price algorithms
An algorithm for constructing edge-trees from hypergraphs
On super i-connected graphs
Conditional centers and medians of a graph
A dual simplex algorithm for finding all shortest paths
Local versus global search in channel graphs
Reliable broadcasting in double loop networks
Time-dependent shortest paths with discounted waits
2003 Glover-Klingman prize winners
Preface: Recent advances in telecommunications networks planning and operation
Reliability analysis of tree-based networks and its application to fault-tolerant VLSI systems
Solving Steiner trees: Recent advances, challenges, and perspectives
An updated annotated bibliography on arc routing problems
An addendum to the most vital edges of matching in a bipartite graph
A robust optimization framework for two-echelon vehicle and UAV routing for post-disaster humanitarian logistics operations
Ripples, complements, and substitutes in singly constrained monotropic parametric network flow problems
Project scheduling with multiple modes: A comparison of exact algorithms
An optimal 2-FT realization of binary symmetric hierarchical tree systems
Transmissions in a network with capacities and delays
Linear programming, by Vasek Chvatal, W. H. Freeman and Company, New York, 1983, 478 pp., Price: $24.95
Recoverable robust shortest path problems
Strictly nonblocking conference networks using high-dimensional meshes
Finding optimum branchings
Gradient estimation via perturbation analysis, by Paul Glasserman, Kluwer, Boston. MA, 1991, 221 pp
Computing minimum 2-edge-connected Steiner networks in the Euclidean plane
An algorithmic framework for the matching problem in some hypergraphs
A differential game model of Nash equilibrium on a congested traffic network
The two-median problem on Manhattan meshes
The symmetric generalized traveling salesman polytope
Multicriteria network location problems with sum objectives
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
De Bruijn and Kautz bus networks
The complexity of the node capacitated in-tree packing problem
Preface: Special issue on the VeRoLog 2015 conference
Branch-cut-price algorithms for solving a class of search problems on general graphs
Efficient algorithms for interval graphs and circular-arc graphs
A neighborhood search algorithm for the combined through and fleet assignment model with time windows
On the separation number of a graph
Min-max optimization of node-targeted attacks in service networks
Two-stage stochastic one-to-many driver matching for ridesharing
Leveraging single-objective heuristics to solve bi-objective problems: Heuristic box splitting and its application to vehicle routing
A genetic approach for the 2-edge-connected minimum branch vertices problem
Decomposable robust two-stage optimization: An application to gas network operations under uncertainty
A matheuristic approach to integrate humping and pullout sequencing operations at railroad hump yards
A column generation approach for SONET ring assignment
Network decomposition for the optimization of connection structures
Majorization and distances in trees
Stochastic bottleneck spanning tree problem
Reliability of interconnection networks modeled by Cartesian product digraphs
Hydraulic network analysis using (generalized) geometric programming
Steiner trees, partial 2-trees, and minimum IFI networks
A column generation algorithm for the demand-responsive feeder service with mandatory and optional, clustered bus-stops
Steiner's problem in graphs and its implications
Stronger path-based extended formulation for the Steiner tree problem
Hierarchical solution of network flow problems
Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph
Approximating multiroot 3-outconnected subgraphs
Algorithms and complexity for the almost equal maximum flow problem
Detecting critical node structures on graphs: A mathematical programming approach
Designing satellite communication networks by zero - one quadratic programming
Fault-tolerant cycle embedding in hierarchical cubic networks
How to colour the lines of a bigraph
A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems
Cooperative covering problems on networks
Efficiency and fairness of system-optimal routing with user constraints
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
Paths and flows for centrality measures in networks
Preface: Special issue on freight transportation and logistics
A generalized measure of independence and the strong product of graphs
A computation-implementation parallelization approach to the vehicle loading and routing problem
A bad submatrix is easy to find
Network augmentation for disaster-resilience against geographically correlated failure
Energy efficiency of data center operating practices: Server clustering, powering on/off, and bang-bang control
Resource allocation by means of project networks: Complexity results
Parameterized algorithms and data reduction for the short secluded s-t-path problem
On some properties of suboptimal colorings of graphs
Finding a minimum equivalent graph of a digraph
Linear time algorithms for computing the most reliable source on an unreliable tree network
A study of the analysis and control of the flow of air traffic: Part II
Efficient special case algorithms for the n-line planar traveling salesman problem
Solving nonlinear multiple-facility network location problems
Lower bounds for the length of test sequences using UIOs
A catalog of Hanan grid problems
Topological expansion of multiple-ring metropolitan area networks
Robust constrained shortest path problems under budgeted uncertainty
Multirate nonblocking multicast Log 2 ( N, m, p ) networks
A delaunay triangulation-based heuristic for the euclidean steiner problem
A note on Bertsekas' small-label-first strategy
Lower planes for the network design problem
Complexity Results for a Cops and Robber Game on Directed Graphs
Multicommodity network flows - A survey
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
Optimal packet fragmentation and routing in computer networks
Minimum spanners of butterfly graphs
The mythical man-month. By Frederick P. Brooks, Jr. Addison-Wesley Publishing Company Reading, Massachusetts 1975, $6.50, 195 pages
The minimum dummy task problem
A product form representation of the inverse of a multicommodity cycle matrix
Twenty-one years in the life of Networks (2000 to 2020)
The Backbone Packet Radio Network coloring for Time Division Multiple Access link scheduling in Wireless Multihop Networks
Sub-Tree Scheduling for Wireless Sensor Networks With Partial Coverage: Complexity and Polynomial-Size Formulations
Energy Networks
Centralized teleprocessing network design
Editorial: 2017 Glover-Klingman Prize Winners
Existence of optimally-greatest digraphs for strongly connected node reliability
Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules
Optimality of consecutive and nested tree partitions
Counting formulas for tree growth plans
A note on scheduling container storage operations of two non-passing stacking cranes
Reoptimizing the traveling salesman problem
Low-cost minimum-time line-broadcasting schemes in complete binary trees
Optimal rectangular partitions
Collection depots facility location problems in trees
Strategic placement of telemetry to reduce routing costs
On multiroute maximum flows in networks
Affine routing for robust network design
The multi-purpose K -drones general routing problem
Editorial: 2006 Glover-Klingman Prize winners
A directed cycle-based column-and-cut generation method for capacitated survivable network design
Maximal vertex-connectivity of
Network flow spanners
Routing in asymmetrical multiconnection three-stage Clos networks
Adjacent extreme flows and application to min concave cost flow problems
Underlying properties of oriented graphs
A note on the upper bound for the paired-domination number of a graph with minimum degree at least two
Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem
The assignment problem with external interactions
On the cycle polytope of a directed graph
Mazes: Search games on unknown networks
Minimax inverse problems of minimum cuts
On the generalized minimum spanning tree problem
"Travels in Computerland, or Incompatibilities and Interfaces" by Ben Ross Schneider, Jr. Addison-Wesley Publishing Company Reading, Massachusetts 1974, $5.95, 256 pages
Complexity results for well-covered graphs
Optimal fault-tolerant networks with a server
Note: Small integral flows need only sparse networks
Earliest arrival flows on series-parallel graphs
Reliable communication in networks with Byzantine link failures
Eccentric graphs
Construction schemes for fault-tolerant Hamiltonian graphs
Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in R d