yusuke1997/dblp-id-title huggingface dataset:
A catalog of steiner tree formulations
Load-balanced routing in counter rotated SONET rings
Minimum shared-power edge cut
The time-consistent dial-a-ride problem
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
Evasive flow capture: Optimal location of weigh-in-motion systems, tollbooths, and security checkpoints
Fiber-To-The-Home Passive Optical Distribution Network Design: A New Formulation and Valid Inequalities Using Polar Duality
A note on bisecting minimum spanning trees
Reliability covering problems
Efficient storage of nonadaptive routing tables
On the online shortest path problem with limited arc cost dependencies
High-confidence estimation of small s - t reliabilities in directed acyclic networks
Optimal error-detection system for identifying codes
Graphs as mathematical models by Gary Chartrand, Prindle, Weber & Schmidt, Inc. Boston, Massachusetts 1977, $15.50, 294 pages
Searching symmetric networks with Utilitarian-Postman paths
On a virtual network functions placement and routing problem: Some properties and a comparison of two formulations
Approximating minimum Steiner point trees in Minkowski planes
Numerical linear algebra and optimization-volume 1, by Philip E. Gill. Walter Murray, and Margaret H. Wright, Addison-Wesley, Redwood City, CA, 1991, 448 pp. Price: $46.25
Paths, chains, and antipaths
Integer models and upper bounds for the 3-club problem
Localizing 2-medians on probabilistic and deterministic tree networks
Minimizing message complexity of partially replicated data on hypercubes
An integrated user-system approach for shelter location and evacuation routing
An efficient graph planarization two-phase heuristic
Algorithms and complexity of range clustering
Modeling a Location and Routing Problem for Mobile Lockers in Last-Mile Delivery With Horizontal Collaboration
Flexibility of Steiner trees in uniform orientation metrics
Preface to the special issue on optimization in vehicle routing and logistics
Join tree propagation with prioritized messages
Distance-constrained multifacility minimax location problems on tree networks
Bisectored unit disk graphs
A new shortest path updating algorithm
Minimizing the complexity of an activity network
Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
Unbalanced, capacitated p -median problems on a chain graph with a continuum of link demands
Minimum-Peak-Cost Flows Over Time
Solving the Hub location problem in telecommunication network design: A local search approach
Simple heuristics for unit disk graphs
Computing network tolls with support constraints
Shout echo selection in distributed files
An efficient implementation of the "partan" variant of the linear approximation method for the network equilibrium problem
Resource allocation by means of project networks: Dominance results
On minimum reload cost paths, tours, and flows
The regenerator location problem
I -Colorings, I -Phasings, and I -Intersection assignments for graphs, and their applications
A linear programming approach to increasing the weight of all minimum spanning trees
Optimal dynamic routing in communication networks with continuous traffic
A heuristic circulation-network approach to solve the multi-traveling salesman problem
New bounds on the minimum number of calls in failure-tolerant gossiping
Optimal online ring routing
ROUTE 2009: Recent advances in vehicle routing optimization
Fixed interval scheduling with third-party machines
Domination and location in acyclic graphs
A network recourse decomposition method for dynamic networks with random arc capacities
Nonexistence of optimal graphs for all terminal reliability
Shortest path algorithms using dynamic breadth-first search
Transversals of subtree hypergraphs and the source location problem in digraphs
Undirected graphs rearrangeable by 2-length walks
An iterated beam search algorithm for the green vehicle routing problem
An algorithm for the equilibrium assignment problem with random link times
A graph-theoretic approach to investigate structural and qualitative properties of systems: A survey
A two-step optimization model for the distribution of perishable products
Targeted multiobjective Dijkstra algorithm
A characterization of irreducible infeasible subsystems in flow networks
The continuous m -center problem on a network
Some minimum gossip graphs
Distributionally risk-receptive and risk-averse network interdiction problems with general ambiguity set
Optimal retrieval in puzzle-based storage with heuristic search and tabulation
Recursive analysis of network reliability
Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations
Combinatorial acyclicity models for potential-based flows
The probabilistic uncapacitated open vehicle routing location problem
Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times
Designing networks: A mixed-integer linear optimization approach
Distinguished vertices in probabilistic rooted graphs
A feedback strategy for periodic network flows
Sufficient degree conditions for k -edge-connectedness of a graph
Balanced network flows. VII. Primal-dual algorithms
On the star - delta transformation in network reliability
Uniform d -emulations of rings, with an application to distributed virtual ring construction
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy
Low cost drainage networks
Channel assignment and weighted coloring
Social network coordination and graph routing
Graph theory and applications, by H. Neville V. Temperley, Halsted Press, New York, 1981, 130 pp. Price: $44.95
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
New polynomial-time cycle-canceling algorithms for minimum-cost flows
Crossing properties of multiterminal cuts
Network optimization for the design of underground mines
A secure voting system on a public network
On a graph coloring problem arising from discrete tomography
Parallel contractions of grids for task assignment to processor networks
Survivable IP network design with OSPF routing
r-domination problems on homogeneously orderable graphs
Planarity testing of doubly periodic infinite graphs
Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem
Optimal flow in networks with gains and costs
Algorithms for a network design problem with crossing supermodular demands
New dynamic programming algorithms for the resource constrained elementary shortest path problem
A minimum cost flow formulation for approximated MLC segmentation
Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
Variations of the prize-collecting Steiner tree problem
Balancing graph Voronoi diagrams with one more vertex
A simple and efficient strategy for solving very large-scale generalized cable-trench problems
Computing approximate Nash equilibria in network congestion games
Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems
A set-partitioning-based exact algorithm for the vehicle routing problem
Predicting deadlock in store-and-forward networks
Search games on networks with travelling and search costs and with arbitrary searcher starting points
Wavelength allocation on trees of rings
An optimal algorithm to solve the all-pair shortest path problem on interval graphs
On maximum ratio clique relaxations
Report: Some recent developments in network economics
Vehicle routing problems in which consistency considerations are important: A survey
Integrating facility location and production planning decisions
Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
An ordered examination of influence diagrams
Solving the routing and spectrum assignment problem, driven by combinatorial properties
A pseudopolynomial network flow formulation for exact knapsack separation
Probabilistic location problems with discrete demand weights
Multistage stochastic programming for integrated network optimization in hurricane relief logistics and evacuation planning
The number of spanning trees in a class of double fixed-step loop networks
Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
Full-load route planning for balancing bike sharing systems by logic-based benders decomposition
Topological formulations and the order of complexity of active networks: A unified survey
Multicommodity flow problems with a bounded number of paths: A flow deviation approach
Realization of a symmetric terminal capacity matrix by a tree with the minimum diameter
Submodularity of minimum-cost spanning tree games
A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem
Social classroom seating assignment problems
A two-commodity sharing problem on networks
Minimum color-degree perfect b-matchings
A cut approach to a class of quadratic integer programming problems
A branch-and-price algorithm for the rainbow cycle cover problems
New approximations for network reliability
Approximation algorithms for distance constrained vehicle routing problems
Network reliability with node failures
The approach-dependent, time-dependent, label-constrained shortest path problem
The n-line traveling salesman problem
Solving the dynamic facility location problem
The minimum order of a cayley graph with given degree and diameter
Rectilinear full Steiner tree generation
The chromatic reduction problem
Minisum location of a traveling salesman
Fast permutation routing in a class of interconnection networks
The fractional congestion bound for efficient edge disjoint routing
Hub network games
Optimization of the reliability polynomial in presence of mediocre elements
Graphical inference in qualitative probabilistic networks
A tree-network has the fixed point property
Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs
Properties of edge-deleted distance stable graphs
Dynamic network flows with arc changes
A fast parametric assignment algorithm with applications in max-algebra
The network equilibrium problem in integers
Team orienteering with uncertain rewards and service times with an application to phlebotomist intrahospital routing
A branch-and-price algorithm for the capacitated p -median problem
Linear arboricity of digraphs
An approximation algorithm for the maximum independent set problem in cubic planar graphs
An algorithm for constructing minimal c-broadcast networks
Sequences of graphical invariants
Underground Freight Transportation for Package Delivery in Urban Environments
EETTlib - Energy-efficient train timetabling library
Matchings in polytopal graphs
An efficient algorithm for K shortest simple paths
Price competition with elastic traffic
The optimal location of a path or tree in a tree network
Collective tree exploration
A note on the traveling repairman problem
Approaches for finding cohesive subgroups in large-scale social networks via maximum k -plex detection
Efficient modeling of travel in networks with time-varying link speeds
Homogeneous sets and domination: A linear time algorithm for distance - hereditary graphs
Network methods in models of production
Integrated job scheduling and network routing
A linear time algorithm for the reverse 1-median problem on a cycle
On the minimum cut separator problem
Harmonic broadcasting is bandwidth-optimal assuming constant bit rate
On the complexity of the bilevel minimum spanning tree problem
Roots of two-terminal reliability polynomials
Locating depots for capacitated vehicle routing
Enhanced methods for the weight constrained shortest path problem
Network analysis and synthesis. by B. D. O. Anderson and S. Vongpanitlerd Prentice-Hall, Inc., Englewood Cliffs, N. J. 1973, 548 pages, $17.95
The stacker crane problem and the directed general routing problem
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
Topology reconstruction using time series data in telecommunication networks
Stackelberg network pricing is hard to approximate
Realizability of p -point, q -line graphs with prescribed point connectivity, line connectivity, or minimum degree
Reformulation and sampling to solve a stochastic network interdiction problem
Introduction to dynamic programming, by Leon Cooper and Mary W. Cooper, Pergamon Press, Elmsford, NY, 1981, 289 pp. Price: $19.50 softcover, $32.50 hardcover
Tabu search for the Steiner problem in graphs
Minimal deadlock-free store-and-forward communication networks
Cycle embedding in faulty wrapped butterfly graphs
The shortest path with at most / nodes in each of the series/parallel clusters
Robust spectrum allocation in elastic flexgrid optical networks: Complexity and formulations
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs
Bilateral trade with risk-averse intermediary using linear network optimization
Reoptimization strategies for a dynamic vehicle routing problem with mixed backhauls
Duality in convex minimum cost flow problems on infinite networks and hypernetworks
The preemptive swapping problem on a tree
A note on a secure voting system on a public network
Solving the minimum-weighted coloring problem
Minimum flows in (s, t ) planar networks
Optimal multifacility defensive location on planes with rectilinear distances
Finding conserved low-diameter subgraphs in social and biological networks
Some recent contributions to routing and location problems
The wireless network jamming problem subject to protocol interference
Stochastic network interdiction with incomplete preference
A lower bound on the chromatic number of a graph
Kernelization and complexity results for connectivity augmentation problems
The processor-sharing queueing model for time-shared systems with bulk arrivals
Approximation algorithms for some k -source shortest paths spanning tree problems
A very short proof of a conjecture concerning set-to-set broadcasting
Avoiding unnecessary demerging and remerging of multi-commodity integer flows
Divide-and-conquer algorithms for graph-layout problems
A flow-first route-next heuristic for liner shipping network design
The maximum residual flow problem: NP -hardness with two-arc destruction
Problem reduction methods and a tree generation algorithm for the steiner network problem
Constructions of small regular bipartite graphs of girth 6
How hard is it to determine if a graph has a 2-role assignment?
Generalized networks: Networks embedded on a matroid, part II
Commodity family extended formulations of uncapacitated fixed charge network flow problems
Finding minimum rectilinear distance paths in the presence of barriers
Location on networks: Theory and algorithms, Gabriel Handler and Pitu Mirchandani, MIT Press, Cambridge, 1979, 233 pp. Price: $20.00
k -Splittable delay constrained routing problem: A branch-and-price approach
Sorting algorithms for the implementation of a generalized vector product
Decentralized maximum-flow protocols
Network reliability analysis using 2-connected digraph reductions
Covering and packing in graphs IV: Linear arboricity
A matroid related to finitely chainlike, countably infinite networks
Canceling most helpful total cuts for minimum cost network flow
Minimal path broadcast networks
Aggregation and disaggregation in convex network problems
Algorithms for finding paths with multiple constraints
Realizability of p-point, q-line graphs with prescribed maximum degree and line connectivity or minimum degree
Preface: Special issue on network analytics and optimization
Topological properties, communication, and computation on WK-recursive networks
Spectral bounds for the maximum cut problem
Multicommodity network design with discrete node costs
Topological properties of incomplete WK-recursive networks
The Capacitated Arc Routing Problem: Lower bounds
Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
Computing the 2-median on tree networks in O(n lg n) time
An innovative operation-time-space network for solving different logistic problems with capacity and time constraints
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
A cut-flow procedure for transportation network optimization
Connectivity-splitting models for survivable network design
Generalized de Bruijn digraphs
Steiner problem in networks: A survey
Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP
Spanners in graphs of bounded degree
Efficient algorithms for a simple network design problem
Solving the large-scale min-max K-rural postman problem for snow plowing
Local bipartite turán graphs and graph partitioning
Generalizations of Hoffman's existence theorem for circulations
A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems
F-Chord: Improved uniform routing on Chord
Exact and hyper-heuristic solutions for the distribution-installation problem from the VeRoLog 2019 challenge
Degenerate Gilbert - Steiner trees
Embedding of cycles and wheels into arbitrary trees
Lazy evaluation in penniless propagation over join trees
An Implicit Enumeration Approach for Maximum Ratio Clique Relaxations
A forbidden minor characterization and reliability of a class of partial 4-trees
Euclidean Steiner minimum trees: An improved exact algorithm
Node fault tolerance in graphs
Local search with perturbations for the prize-collecting Steiner tree problem in graphs
An approximation algorithm for Stackelberg network pricing
A recursive formula for the two-edge connected and biconnected reliability of a complete graph
Scheduling file transfers in fully connected networks
Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
Solving minimum K-cardinality cut problems in planar graphs
Collaborative transportation for attended home deliveries
The Program, Conclusions and Recommendations
A simple O(n 2 ) algorithm for the all-pairs shortest path problem on an interval graph
How vulnerable is an undirected planar graph with respect to max flow
Capacity provisioning for evacuation on path networks
Computer systems performance modeling, by Charles H. Sauer and K. Mani Chandy, Prentice-Hall, 1981, 352pp. Price: $18.95
Locating an obnoxious facility on a euclidean network to minimize neighborhood damage
On a measure of communication network vulnerability
On the Complexity of Computing Maximum and Minimum Min-Cost-Flows
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
A separation decomposition for orders
An extended model and a column generation algorithm for the planar multicommodity flow problem
The search value of a network
An augmenting-flow algorithm for a class of node-capacitated maximum flow problems
Time-varying shortest path problems with constraints
Rearrangeability of multi-connection three-stage clos networks
Optimization of Internet Protocol network design and routing
Minimal spanning trees in undirected networks with exponentially distributed arc weights
The vehicle routing problem with drones: Extended models and connections
Uncertainty in FTTH splitter installation
Computer models for management science, 3rd ed., by Warren Erikson and Owen Hall, Addison-Wesley, Reading, MA, 1989, 263 pp
Vulnerability of communication networks
Stochastic maximum weight forest problem
Block-vertex duality and the one-median problem
Finding minimum cost to time ratio cycles with small integral transit times
A decomposition approach to nonlinear programs as applied to reservoir systems
Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior
Bounds on the fault-diameter of graphs
Optimal enclosing regions in planar graphs
Optimization: Theory and applications, by S . S . Rao, Wiley Eastern Limited, New Delhi, 1979, 711 pp. Price: $21.95
Online scheduling with multi-state machines
A note on "A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs"
Modeling the flying sidekick traveling salesman problem with multiple drones
On the Traffic Handling Capability of Communication Networks Homogeneously Loaded
More facets for survivable networks
An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs
Operations research: Applications and algorithms, by Wayne L. Winston, duxbury Press, Boston, 1987, 1025 pages
Solving Steiner tree problems in graphs to optimality
Network reliability: Heading out on the highway
Parcel delivery cost minimization with time window constraints using trucks and drones
Shortest-path network interdiction
A network equilibrium formulation of market disequilibrium and variational inequalities
Routing algorithms for switching networks with probabilistic traffic
On terminal delta-wye reducibility of planar graphs
Edge-superconnectivity of semiregular cages with odd girth
Toward fast calculation of communication paths for resilient routing
Stability of networks and protocols in the adversarial queueing model for packet routing
Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks
Integrated commercial and operations planning model for schedule design, aircraft rotation and crew scheduling in airlines
On general routing problems
Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem
On capacitated stochastic chain problems in a network
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
Bounding distributions for a stochastic pert network
New largest known graphs of diameter 6
Solving the probabilistic drone routing problem: Searching for victims in the aftermath of disasters
A branch-and-price algorithm for the vehicle routing problem with time windows on a road network
A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries
An adaptive large neighborhood search with path relinking for a class of vehicle-routing problems with simultaneous pickup and delivery
Reversibility and stochastic networks, by Frank P. Kelly, Wiley, New York, 1979, 230 pp. Price: $50.95
Complexity of vehicle routing and scheduling problems
The bottleneck graph partition problem
Complexity and approximability of the maximum flow problem with minimum quantities
Components and graph automorphisms of standard 2 x 2-switch banyan networks
Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
On maximum degree-based γ-quasi-clique problem: Complexity and exact approaches
The single robot line coverage problem: Theory, algorithms, and experiments
On Constrained Minimum Weight Edge Covers With Applications to Emergency Planning
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
Extremal connectivity and vulnerability in graphs
A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time
Improved upper and lower bounds for k-broadcasting
The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
A comparison of phase and nonphase network flow algorithms
A fundamental problem in vehicle routing
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
Solving stochastic programs with network recourse
Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results
Vertex domination-critical graphs
All ( k ; g )-cages are edge-superconnected
A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs
New assignment-based neighborhoods for traveling salesman and routing problems
On the numerical evaluation of some basic traffic formulae