yusuke1997/dblp-id-title huggingface dataset:
Finding maximum cliques in circle graphs
On the Complexity of the Bilevel Shortest Path Problem
Iterative methods for determining the k shortest paths in a network
Combinatorics for computer science , by S. gill williamson, computer science press, Rockville, MD. 1985, 479 pp. price: $39.95
Tracking the P-NP boundary for well-covered graphs
On the use of guided design search for discovering significant decision variables in the fixed-charge capacitated multicommodity network design problem
Some recent contributions to network optimization
Universally maximum flow with piecewise-constant capacities
A proof of Boesch's conjecture
Sense of direction: Definitions, properties, and classes
Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria
A Vertex Elimination Algorithm for Enumerating all Simple Paths in a Graph
Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
A routing procedure for an IC module with many pins - a solution to a circular permutation layout problem
Robust capacity expansion of a network under demand uncertainty: A bi-objective approach
Eulerian location problems
Stochastic modeling and the theory of queues, by R. W. WOE, Rentice Hall, Engle- wood Cliffs, NJ, 1989, 556 pp
Matchings in connection with ground delay program planning
Preface: Special issue on Arc Routing Problems
Efficient points on a network
Solving partial constraint satisfaction problems with tree decomposition
Shortest paths in networks with exponentially distributed arc lengths
Orienting split-stars and alternating group graphs
On optimal orientations of Cartesian products of even cycles and paths
Probabilistic methods in combinatorics. By Paul Erdös and Joel Spencer Academic Press, Inc., New York 1974, 106 Pages, $11.75
On the spanning w -wide diameter of the star graph
On reliability of graphs with node failures
The complexity of integrating passenger routing decisions in public transportation models
A fast algorithm for reliability calculations in sparse networks
On a function for the vulnerability of a directed flow network
A node-based ILP formulation for the node-weighted dominating Steiner problem
Multifacility ordered median problems on networks: A further analysis
Minimum cost flow-dependent communication networks
Constrained length connectivity and survivable networks
Balanced graphs and network flows
Undirected loop networks
Inverse optimization in minimum cost flow problems on countably infinite networks
Fault - tolerant hypercube broadcasting via information dispersal
Vector connectivity in graphs
Dimensioning multicast-enabled communications networks
Integer programming formulations for minimum deficiency interval coloring
Parametric analysis of optimal facility locations
Backordering in a multiperiod transshipment network
A polynomial time algorithm for finding the absolute center of a network
Robust path choice in networks with failures
Cost allocation for a spanning tree
Lexicographically optimal earliest arrival flows
Fixed tree games with multilocated players
New approaches for solving the block-to-train assignment problem
Minimum cost routing for static network models
Balanced network flows. III. Strongly polynomial augmentation algorithms
A two-phase Pareto local search heuristic for the bi-objective pollution-routing problem
On the distance between random events on a network
Balanced network flows. II. Simple augmentation algorithms
On restricted connectivities of permutation graphs
Detecting resilient structures in stochastic networks: A two-stage stochastic optimization approach
A branch-and-cut algorithm for the ring spur assignment problem
Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem
The shortest and the K-shortest routes as assignment problems
Two extended formulations for the virtual network function placement and routing problem
On provably best construction heuristics for hard combinatorial optimization problems
Locating a cycle in a transportation or a telecommunications network
Bidirected minimum Manhattan network problem
Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphs
Solving multistage stochastic networks: An application of scenario aggregation
A recognition algorithm for the total graphs
On a Random Walk Survivability problem with arc failures and memory
A probabilistic model for the analysis of the routing process for circuits
Diameter-preserving orientations of the torus
From the editors
Metric tree-like structures in real-world networks: an empirical study
Optimal flows in nonlinear gain networks
On irreducible no-hole L (2, 1)-coloring of trees
A generalized upper bounding approach to a communications network planning problem
On the computational complexity of the minimum-dummy-activities problem in a pert network
An effective algorithm for computing all-terminal reliability bounds
The most reliable series-parallel networks
The forwarding indices of wrapped butterfly networks
Optimal gossiping in geometric radio networks in the presence of dynamical faults
Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances
Fault-tolerant broadcast graphs
Minimal rankings
Solving multitrip vehicle routing under order incompatibilities: A VRP arising in supply chain management
The multiroute maximum flow problem revisited
A two-stage network interdiction-monitoring game
A lower bound for interval routing in general networks
Two algorithms for the subset interconnection design problem
Feasibility in transportation networks with supply eating arcs
Approximate L (delta 1 , delta 2 , ..., delta t )-coloring of trees and interval graphs
A strong formulation for the graph partition problem
Identifying independence in bayesian networks
Balanced spanning forests and trees
On container length and connectivity in unidirectional hypercubes
On stackelberg pricing with computationally bounded customers
Preface: Static and dynamic optimization models for network routing problems
A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem
Geodiverse routing with path delay and skew requirement under area-based challenges
A fast heuristic approach for large-scale cell-transmission-based evacuation route planning
An efficient implementation of an algorithm for finding K shortest simple paths
Cheapest paths in dynamic networks
Sufficient conditions for graphs to be lambda' -optimal and super- lambda'
Applications of E-graphs in network design
Some edge-fault-tolerant properties of the folded hypercube
Home Healthcare Staffing, Routing, and Scheduling Problem With Multiple Shifts and Emergency Considerations
Effects of update frequencies in a dynamic capacitated arc routing problem
Open shortest path first routing under random early detection
Reliability of interconnection networks modeled by a product of graphs
Minimizing SONET Add-Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths
A branch-and-cut algorithm for the preemptive swapping problem
Robust recoverable perfect matchings
An algorithm for reliability analysis of planar graphs
A New Formulation for the Traveling Salesman Problem With Drone and Lockers
Upgrading trees under diameter and budget constraints
A column generation approach for the split delivery vehicle routing problem
Length-constrained path-matchings in graphs
Approximation algorithm for the group Steiner network problem
Directed network reliability: Domination and computing coefficients of the success-marginal expansion
File distribution in networks with multimedia storage servers
The continuous p -median of a network
Cover inequalities for robust knapsack sets - Application to the robust bandwidth packing problem
Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem
A branch-and-price algorithm for the single-path virtual network embedding problem
Embedding grids into grids: Techniques for large compression ratios
Mean flow scheduling and optimal construction of a treelike communication network
Synthesis of modulation insensitive N-path filters
Techniques for analyzing dynamic random graph models of web-like networks: An overview
On the complexity of distributed graph coloring with local minimality constraints
Special issue of Networks on optimization in scheduled transportation networks
A dual algorithm for the constrained shortest path problem
Optimization models for planning and allocation: Text and cases in mathematical programming, by Roy D. Shapiro, John Wiley & Sons, New York, 1984, 650 pp. Price $40.95
The flow deviation method: An approach to store-and-forward communication network design
Theoretical and computational advances for network diversion
Balancing profits and costs on trees
Optimal design of centralized computer networks
Directions for future research on urban mobility and city logistics
An adaptive and diversified vehicle routing approach to reducing the security risk of cash-in-transit operations
Reliability polynomials having arbitrarily many inflection points
The multi-depot family traveling salesman problem and clustered variants: Mathematical formulations and branch-&-cut based methods
Almost sure asymptotic optimality for online routing and machine scheduling problems
The average height of the d -th highest leaf of a planted plane tree
Exactly solving a two-level location problem with modular node capacities
A dual-ascent procedure for the file allocation and join site selection problem on a telecommunications network
Scatter search for the profile minimization problem
Integer programming formulations for the k -edge-connected 3-hop-constrained network design problem
A truncated primal-infeasible dual-feasible network interior point method
Line-broadcasting in complete k -ary trees
A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints
Distance edge coloring and collision-free communication in wireless sensor networks
On the roots of the node reliability polynomial
A linear algorithm for finding the k -broadcast center of a tree
Drone delivery from trucks: Drone scheduling for given truck routes
Antepenultimate broadcasting
A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
Isomorphisms of the De Bruijn digraph and free-space optical networks
Nonadaptive broadcasting in trees
Optimally edge fault-tolerant trees
Minimizing the makespan in multiserver network restoration problems
Heuristic Programming as an Aid to Network Design
A shortest path algorithm for grid graphs
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
Hybrid genetic algorithm for undirected traveling salesman problems with profits
A recursive algorithm for finding reliability measures related to the connection of nodes in a graph
Lower and upper bounds for the degree-constrained minimum spanning tree problem
An algorithm for the steiner problem in graphs
Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle
The minimum augmentation of a directed tree to a k -edge-connected directed graph
A decomposition algorithm for network reliability analysis
On the superconnectivity and the conditional diameter of graphs and digraphs
On the super-restricted arc-connectivity of s -geodetic digraphs
Node partition formula for directed graph reliability
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem
Embedding interconnection networks in grids via the layered cross product
A minimum-cost multicommodity network flow problem concerning imports and exports
A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group
A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem
Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
Financial flow of funds networks
A GRASP for graph planarization
A distributed dual ascent algorithm for Steiner problems in multicast routing
Some graph-theoretical models for scheduling in automated production systems
The next-to-shortest path problem on directed graphs with positive edge weights
Packing the Steiner trees of a graph
A combinatorial problem related to distributed loop networks
Implementing a proximal algorithm for some nonlinear multicommodity flow problems
A comparison of several models for the hamiltonian p -median problem
A simple algorithm that proves half-integrality of bidirected network programming
Vehicle routing problems with different service constraints: A branch-and-cut-and-price algorithm
A linear-size zero - one programming model for the minimum spanning tree problem in planar graphs
On some matching problems arising in vehicle scheduling models
Uniformly least reliable graphs
Matrix-geometric solutions in stochastic models: An algorithmic approach, by Marcel R. Neuts, The Johns Hopkins University Press, Baltimore, 1981, 352 pp. Price: $32.50
Matching preclusion for some interconnection networks
On multiple steiner subgraph problems
The optimal partitioning of networks
Recent results on Arc Routing Problems: An annotated bibliography
On shortest two-connected Steiner networks with Euclidean distance
A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
Minimum-weight rooted not-necessarily-spanning arborescence problem
An upper bound on the number of cliques in a graph
Large-scale zone-based evacuation planning - Part I: Models and algorithms
Partial target coverage to extend the lifetime in wireless multi-role sensor networks
An exact bidirectional A⋆ approach for solving resource-constrained shortest path problems
Robust capacitated Steiner trees and networks with uniform demands
The network simplex method on a multiprocessor
Euclidean shortest path in the presence of obstacles
A simple derivation of Edmonds' algorithm for optimum branchings
Connectedness of finite distance graphs
Network search games, with arbitrary searcher starting point
SRLG failure localization using nested m-trails and their application to adaptive probing
Tree decomposition algorithm for large networks
Property P d , m and efficient design of reliable networks
Balanced paths in acyclic networks: Tractable cases and related approaches
The connected hub number and the connected domination number
The search game on a network with immobile hider
Queueing networks with blocking, edited by H. G. Perros and T. Altiok, North-Holland, Amsterdam, 1989, 358 pp
Multistars and directed flow formulations
Networks synthesis and optimum network design problems: Models, solution methods and applications
The dynamic predicate stashing copy problem
State-space partition techniques for multiterminal flows in stochastic networks
Various results on the toughness of graphs
Transformations for simplifying network reliability calculations
Stochastic programs over trees with random arc capacities
Online traveling salesman problems with service flexibility
A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
Preface: Special issue on network optimization in transportation, logistics, and industry
Thirty-five-point rectilinear steiner minimal trees in a day
Adaptive large neighborhood search for the periodic capacitated arc routing problem with inventory constraints
On optimal cycle bases of graphs for mesh analysis of networks
Balance vertices in trees
On super connectivity of Cartesian product graphs
Routing permutations on a graph
A hybrid multicommodity routing algorithm for traffic engineering
"Make no little plans": Impactful research to solve the next generation of transportation problems
A dynamic programming algorithm for the conditional covering problem on tree graphs
A functional equation for finding the largest expected capacity of a graph
An annotated bibliography of network interior point methods
Towards minimum k-geodetically connected graphs
Oriented hypercubes
Hamilton cycles and paths in butterfly graphs
Disjoint ( s, t )-cuts in a network
Computational study of an improved shortest path algorithm
A randomized approximation algorithm for probabilistic inference on bayesian belief networks
A recursive algorithm for directed-graph reliability
On the connectivity and the conditional diameter of graphs and digraphs
The K-partitioning problem: Formulations and branch-and-cut
Small-worlds: A review of recent books
Selecting vertex disjoint paths in plane graphs
A primal algorithm for solving a capacitated network flow problem with additional linear constraints
Have a Good Travel Time in Routing: Bibliometric Analysis, Literature Review, and Future Directions
Weighted target set selection on trees and cycles
Area efficient layouts of the Batcher sorting networks
The vehicle routing problem with time windows and temporal dependencies
On the difficulty of virtual private network instances
Applied combinatorics, by Alan Tucker, Wiley, New York, 1980, 385 pp. Price: $23.95
Branch-and-Bound Algorithms for the K$$ K $$-Cluster Problem Based on SDP Bounds Evaluated by Lagrangian Relaxation
Uniformly optimally reliable graphs
Connected reorientations of mixed multigraphs
A modeling and computational study of the frustration index in signed networks
Ranking the vertices of a weighted digraph using the length of forward arcs
Matheuristic Algorithms for the Inventory Routing Problem With Unsplit and Split Deliveries
On multicommodity flows in planar graphs
Preface: Special issue on the future of route optimization/vehicle routing
Steiner tree problems
A Reach and Bound algorithm for acyclic dynamic-programming networks
A bidirected generalization of network matrices
Minimum-risk routing through a mapped minefield
Complexity of the minimum-dummy-activities problem in a pert network
Coding graphs by contractions
Scheduling two chains of unit jobs on one machine: A polyhedral study
On cost allocation for a spanning tree: A game theoretic approach
Probabilistic analysis of a network design problem heuristic
Complexity of some inverse shortest path lengths problems
Methods of the allocation of limited resources, by K. M. Mjelde, John Wiley and Sons, Chichester, 1983, 88 pp. Price: $24.95
Heuristic and exact algorithms for scheduling aircraft landings
Lagrangean decomposition/relaxation for the routing and wavelength assignment problem
Network design with vulnerability constraints and probabilistic edge reliability
Finding least fuel emission paths in a network with time-varying speeds
A linear-time algorithm for broadcast domination in a tree
Nonblocking multirate log 2 ( N , m , p ) switching networks with multicast connections
Dedicated protection of multicast sessions in mixed-graph sparse-splitting optical networks
Projecting the flow variables for hub location problems
Matching problems with generalized upper bound side constraints
A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone
A 1-matching blossom-type algorithm for edge covering problems
Tangle bases: Revisited
Graph substitution and set packing polytopes
Uncertainty feature optimization: An implicit paradigm for problems with noisy data
Locating a facility on a congested network with random lengths
A branch-and-price algorithm for the ( k, c )-coloring problem
Stochastic Aspects of Networks
Robust bottleneck routing games
Classification in vehicle routing and scheduling
Generalized eccentricity, radius, and diameter in graphs
An integer program for positive semidefinite zero forcing in graphs
Greedy approximation algorithms for directed multicuts
The polytope of block diagonal matrices and complete bipartite partitionings
A mobility model for studying wireless communication and the complexity of problems in the model
A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem
The school bus routing and scheduling problem with transfers
Efficient algorithms for centers and medians in interval and circular-arc graphs
Balanced network flows. IV. Duality and structure theory
A network flow approach to cost allocation for rooted trees
Fast Shapley Value Approximation Through Machine Learning With Application in Routing Problems
Degree-preserving trees
Optimal routing and process scheduling for a mobile service facility
The ultracenter and central fringe of a graph
Algorithms for maximum k -colorings and k -coverings of transitive graphs
On algorithms for finding the k shortest paths in a network
The intractability of the reliable assignment problem in split networks
A eulogy for Frank Boesch
Recent challenges in Routing and Inventory Routing: E-commerce and last-mile delivery
Some results about f -critical graphs
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem
An algorithmic note on the gallai-milgram theorem
An approach to a problem in network design using genetic algorithms
On the construction of minimal broadcast networks
Large vertex symmetric digraphs
An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree
Editorial: 2009 Glover-Klingman Prize winners
Approximate solutions of capacitated fixed-charge minimum cost network flow problems
Asymptotic bounds for clustering problems in random graphs
In search of network resilience: An optimization-based view
Heuristic reoptimization of time-extended multi-robot task allocation problems
A polyhedral study of the capacity formulation of the multilayer network design problem
Minimum cost flow with set-constraints
A linear time algorithm to recognize circular permutation graphs
Reduced-size formulations for metric and cut polyhedra in sparse graphs
Panpositionable hamiltonicity of the alternating group graphs
A polynomial time solvable concave network flow problem
Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
On the road to better routes: Five decades of published research on the vehicle routing problem
Selectively closing recycling centers in Bavaria: Reforming waste-management policy to reduce disparity
Topics in Combinatorial Optimization. Edited By S. Rinaldi, Springer-Verlag New York, New York, 1975, $15.20, 186 Pages
Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks
A railroad maintenance problem solved with a cut and column generation matheuristic
Probabilistic models for the Steiner Tree problem
Extreme point characterizations for infinite network flow problems
Editorial: Preface to the special issue
Routing a fleet of M vehicles to/from a central facility
Online traveling salesman problems with rejection options
Minimum cost flow problem with conflicts
Maximum independent number for series-parallel networks
An algorithm for the steiner problem in the euclidean plane
Towards simulation based mixed-integer optimization with differential equations
Allocation of partially renewable resources: Concept, capabilities, and applications
The Capacitated Minimum Spanning Tree
Editorial: Preface to the Special Issue
Network design with probabilistic capacities
Nearly optimal three dimensional layout of hypercube networks
Solving the close-enough arc routing problem
A general dynamic spatial price network equilibrium model with gains and losses
Exact algorithms for minimum routing cost trees
A competitive scheduling problem and its relevance to UMTS channel assignment
A note on genetic algorithms for degree-constrained spanning tree problems
A combinatorial auction-based approach for ridesharing in a student transportation system
Introduction to mathematical programming: Quantitative tools for decision-making, by Benjamin Lev and Howard J. Weiss, North-Holland, New York, 1982, 287 pp. Price: $39.50
The subtree center of a tree
Solution methods for the p -median problem: An annotated bibliography
Forbidden subgraphs and graph decomposition