yusuke1997/dblp-id-title huggingface dataset:
Minimizing beam-on time in cancer radiation treatment using multileaf collimators
Exact algorithms for the vertex separator problem in graphs
Paths through a maze of rectangles
A survey on optimization studies of group centrality metrics
Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms
A branch-and-bound algorithm for the double travelling salesman problem with two stacks
Worst-case greedy matchings in the unit d -cube
Simplifying obstacles for Steiner network problems in the plane
Periodic railway timetabling with event flexibility
State space partitioning methods for stochastic shortest path problems
Multiple searchers searching for a randomly distributed immobile target on a unit network
Algorithms for source-to-all maximum cost-to-time ratio problem in acyclic networks
Lower bounds on the vulnerability of a graph
Fixed-parameter tractability results for full-degree spanning tree and its dual
Optimal communication in networks with randomly distributed byzantine faults
Near-shortest and K-shortest simple paths
Level graphs and approximate shortest path algorithms
A branch-price-and-cut algorithm for the min-max k -vehicle windy rural postman problem
Models and heuristics for a minimum arborescence problem
Minimal diameter double-loop networks. I. Large infinite optimal families
A note on the bottleneck graph partition problem
Wide diameter and minimum length of disjoint Menger path systems
The orienteering problem with variable profits
On super edge-connectivity of Cartesian product graphs
In search of dense subgraphs: How good is greedy peeling?
Greedy online algorithms for routing permanent virtual circuits
Fast upper and lower bounds for a large-scale real-world arc routing problem
On the complexity of equal shortest path routing
Fixed-parameter tractability and data reduction for multicut in trees
Affine recourse for the robust network design problem: Between static and dynamic routing
The helical cube network
Several 2-facility location problems on networks with equity objectives
Cooperative triangulation in MSBNs without revealing subnet structures
Exact solution approaches for the discrete α -neighbor p -center problem
Fast collective communication by packets in the postal model
Communication structures in fault-tolerant distributed systems
Spanning tree modulus for secure broadcast games
On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
Faster exact algorithms for steiner trees in planar networks
The most reliable flight itinerary problem
The strongly connected reliability of complete digraphs
Neighbor-connected graphs and projective planes
The ℓp-function on trees
On crossings, the Crossing Postman Problem, and the Rural Postman Problem
Off-line permutation routing on circuit-switched fixed-routing networks
Effectiveness of demand and fulfillment control in dynamic fleet management of ride-sharing systems
Traffic signal optimization using cyclically expanded networks
An algorithm for the traffic assignment problem
Minimum k -geodetically connected digraphs
A graph theoretic approach to the grouping of ordering data
Uniformly optimally reliable graphs: A survey
Rectilinear steiner trees: Efficient special-case algorithms
The beta-reliable minimax and maximin location problems on a network with probabilistic weights
Experimental evaluation of a partitioning algorithm for the steiner tree problem in R 2 and R 3
A survey of some network reliability analysis and synthesis results
Partitions, Decomposition, Sparsity
Dynamic matchings and quasidynamic fractional matchings. II
Discrete location theory, edited by P. B. Mirchandani and R. L. Francis, John Wiley & Sons, New York, 1990, 555 pp
An improvement of Orloff's general routing problem
A Newton method for convex separable network flow problems
Personnel shift assignment: Existence conditions and network models
Graphs with not too many spanning trees
Consecutive cuts and paths, and bounds on k -terminal reliability
Pseudo-Gilbert-Steiner trees
Probabilistic N-k failure-identification for power systems
A robust optimization model for affine/quadratic flow thinning: A traffic protection mechanism for networks with variable link capacity
An improved deniable authentication protocol
A lower bound on the average shortest path length in regular graphs
Minimum-weight cycles in 3-separable graphs
Column generation algorithm for sensor coverage scheduling under bandwidth constraints
New advances and applications in deterministic and stochastic network optimization
A branch-and-dive heuristic for single vehicle snow removal
A network based model of a promotion-sensitive grocery logistics system
Robust capacity assignment solutions for telecommunications networks with uncertain demands
Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications
Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator
Fault-tolerant graphs for tori
Network optimization practice: A Computational Guide, by D. K. Smith, John Wiley, New York, 1982, 237 pp. Price: $59.95
New upper bound on m -time-relaxed k -broadcast graphs
A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints
Provisioning virtual private networks under traffic uncertainty
Deterministic network optimization: A bibliography
An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions
Editorial: 2014 Glover-Klingman Prize winners
Algorithms on circular-arc graphs
The relocation problem for the one-way electric vehicle sharing
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
Heuristics for planar minimum-weight perfect metchings
A new characterization of tree medians with applications to distributed sorting
Compounding of gossip graphs
The even-path problem for graphs and digraphs
Wavelength assignment in multifiber star networks
Series-parallel subgraphs of planar graphs
Local search metaheuristics for the critical node problem
Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes
New path elimination constraints for multi-depot routing problems
The 2-path network problem
Hop-level flow formulation for the survivable network design with hop constraints problem
The vehicle rescheduling problem: Model and algorithms
An algorithm for finding a large independent set in planar graphs
Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the VeRoLog Solver Challenge 2019
Extended generalized shuffle networks: Ssufficient conditions for strictly nonblocking operation
Low-congested interval routing schemes for hypercubelike networks
Simultaneous embeddings of graphs as median and antimedian subgraphs
Cycles in butterfly graphs
Optical index of fault tolerant routings in WDM networks
Heuristics for finding a maximum number of disjoint bounded paths
Heuristics for a hub location-routing problem
A tabu search heuristic for the Steiner Tree Problem
Embedding iterated line digraphs in books
An A-Priori-Splitting-Based Heuristic for the Split Delivery Vehicle Routing Problem With Time Windows
The family traveling salesman problem with incompatibility constraints
Note on independence of arcs in antiparallel for network flow problems
A unified approach to network location problems
Dynamic programming: Models and applications, by Eric V. Denardo, Prentice-Hall, Englewood Cliffs, NJ, 1932, 227 pp. Price: $26.95
Vertex covering with capacitated trees
Minimum k-cores and the k-core polytope
A branch-and-cut algorithm for the undirected selective traveling salesman problem
Black hole search in common interconnection networks
Joint vehicle assembly-routing problems: An integrated modeling and optimization approach
Maximum weight perfect matching problem with additional disjunctive conflict constraints
An Algorithm for r -Bases of a Directed Graph
Freight car dispatching with generalized flows
Queueing Systems, Volume 2: Computer applications. by Leonard Kleinrock John Wiley & Sons, Inc., New York 1976, 549 Pages, $24.95
On the optimal strongly connected orientations of city street graphs. III. Three east-west avenues or north-south streets
Formulations and valid inequalities for the capacitated dispersion problem
The single-vehicle routing problem with unrestricted backhauls
Forbidden subpaths for Steiner minimum networks in uniform orientation metrics
Cost-optimal truck-and-robot routing for last-mile delivery
Networks in economics and finance in Networks and beyond: A half century retrospective
Source location problems considering vertex-connectivity and edge-connectivity simultaneously
A rolling horizon framework for the time-dependent multi-visit dynamic safe street snow plowing problem
The forwarder planning problem in a two-echelon network
Algorithms for computing message delay for wireless networks
Rate-adaptive multipath routing: Distributed, centralized, and hybrid architectures
Solving the team orienteering problem with nonidentical agents: A Lagrangian approach
The driver assignment vehicle routing problem
On the geodetic number of a graph
On the hardness of range assignment problems
Electronic voting in a large-scale distributed system
Properties of the k -centra in a tree network
Anticenters and antimedians of a network
Theory of linear and integer programming, by Alexander Schrijver, Wiley, New York, 1986, 471 pp. Price $71.95
The node cop-win reliability of unicyclic and bicyclic graphs
The simplex algorithm for multicommodity networks
Network fair bandwidth share using hash rate estimation
Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
Network design arc set with variable upper bounds
A linear time algorithm for the unbalanced Hitchcock transportation problem
Branch-and-price for energy optimization in multi-hop wireless sensor networks
Computation of the forwarding index via flows: A note
Minimizing recovery cost of network optimization problems
Implementation of algorithms for K shortest loopless paths
On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem
2019-2020 Glover-Klingman Prize Winners
Revisiting deadlock prevention: A probabilistic approach
Efficient algorithms for inferring evolutionary trees
Editorial: 2015 Glover-Klingman Prize Winners
Minmax-regret robust 1-median location on a tree
a generalized network flow model with application to power supply-demand problems
An edge scanning method for the continuous deviation-flow refueling station location problem on a general network
A mean-variance model for the minimum cost flow problem with stochastic arc costs
Content placement in 5G-enabled edge/core data center networks resilient to link cut attacks
A response to Volgenant's Addendum on the most vital edges
Multidimensional assortment problem with an application
Package routing in transportation networks with fixed vehicle schedules
On tree 3-spanners in directed path graphs
Faster computation of successive bounds on the group betweenness centrality
Decontamination of hypercubes by mobile agents
A network flow algorithm to find an elementary I/O matching
Super edge- and point-connectivities of the Cartesian product of regular graphs
A network model for the rotating workforce scheduling problem
Improper coloring of unit disk graphs
An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
Network upgrading problems
New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
Algorithms for finding P-centers on a weighted tree (for relatively small P)
Optimizing edge sets in networks to produce ground truth communities based on modularity
Worst-case incremental analysis for a class of p-facility location problems
A bicriterion approach for routing problems in multimedia networks
An incremental algorithm for the uncapacitated facility location problem
A single-server priority queueing-location model
Agile optimization for a real-time facility location problem in Internet of Vehicles networks
ILP-based heuristics for a virtual network function placement and routing problem
Iterated local search for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints
Optimizing the ecological connectivity of landscapes
The pickup delivery location problem on networks
Approximating Steiner trees in graphs with restricted weights
A strong lower bound for the Node Weighted Steiner Tree Problem
A note on detecting unbounded instances of the online shortest path problem
On matchings, T-joins, and arc routing in road networks
The steiner problem in the hypercube
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
Precedence-Constrained Shortest Path
Computer Networks: Art to Science to Art
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
Unimodal eccentricity in trees
Sequential information dissemination by packets
On superconnectivity of (4, g )-cages with even girth
Approximation algorithms for Steiner forest: An experimental study
Hardness and approximation for network flow interdiction
Minimum augmentation of a tree to a K-edge-connected graph
Generalized elastic flow rerouting scheme
Robust location problems with pos/neg weights on a tree
Some generalizations of the steiner problem in graphs
Multi-Stage Network Interdiction With Decision-Dependent Success: Scenario Clustering and Reformulation Techniques
An algorithm for construction of a k -connected graph with minimum number of edges and quasiminimal diameter
Lowering eccentricity of a tree by node upgrading
A linear-time algorithm for the k -fixed-endpoint path cover problem on cographs
Most reliable double loop networks in survival reliability
Connectivity and diameter in distance graphs
The cohesiveness of a point of a graph
Formulations and exact solution approaches for the degree preserving spanning tree problem
Graphs as models of communication network vulnerability: Connectivity and persistence
MLH: A hierarchical hypercube network
Constructing optimal subnetworks for the crossed cube network
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
The cone of flow matrices: Approximation hierarchies and applications
A stochastic petri net with applications to modelling occupancy times for concurrent task systems
On an effective approach for the coach trip with shuttle service problem of the VeRoLog solver challenge 2015
Solutions to conjectures on the ( k , ℓ)-rainbow index of complete graphs
Tenacity of complete graph products and grids
Survivable green traffic engineering with shared protection
Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs
Generalized network design polyhedra
A stochastic integer programming approach to solving a synchronous optical network ring design problem
Restricted simplicial decomposition with side constraints
On large (Delta, 6)-Graphs
Valid cycles: A source of infeasibility in open shortest path first routing
The path set polytope of an acyclic, directed graph with an application to machine sequencing
Simple linear flow decomposition algorithms on trees, circles, and augmented trees
Decision making, models and algorithms: A first course, by Saul I. Gass, John Wiley & Sons, New York, 1985, 412 pp
A branch-and-cut algorithm for partition coloring
Optimizing ground station networks for free space optical communications: Maximizing the data transfer
A generalized dynamic flows problem
Maximizing residual flow under an arc destruction
Investment in stochastic minimum cost generalized multicommodity networks with application to coal transport
Competitive algorithms and lower bounds for online randomized call control in cellular networks
A hub covering model for cargo delivery systems
Computing the probability distribution of project duration in a PERT network
Node-disjoint paths and related problems on hierarchical cubic networks
Minimax flow tree problems
A novel approach to phylogenetic trees: d -Dimensional geometric Steiner trees
Editorial: 2005 Glover-Klingman prize winners
Centroids to centers in trees
An inexact sample average approximation approach for the stochastic connected facility location problem
Anti-stalling pivot rules for the network simplex algorithm
The workforce scheduling and routing problem with park-and-loop
Monte Carlo tree search for dynamic shortest-path interdiction
Topological design of centralized computer networks - formulations and algorithms
2-diameter of de Bruijn graphs
The center function on trees
A study of the analysis and control of the flow of air traffic: Part III
A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
An efficient approach to optimization of semi-stable routing in multicommodity flow networks
The fractional matching numbers of graphs
On clique-extremal (p, q)-graphs
Multistage methods for freight train classification
Linear programming and network modesl, by S. K. Gupta, affiliated East-West Press Pvt. Ltd. New Delhi, 1985, 230 pp
Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory
Complexity of the Directed Robust b-Matching Problem and Its Variants on Different Graph Classes
Proximity and remoteness in graphs: Results and conjectures
Uniformly optimal digraphs for strongly connected reliability
Cell suppression: Disclosure protection for sensitive tabular data
Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components
The performance of QoS-aware IP multicast routing protocols
Toward fault-tolerant multi-robot networks
On the existence of uniformly optimally reliable networks
Hierarchical vehicle routing problems
The perfectly matchable subgraph polytope of a bipartite graph
The one-commodity pickup and delivery travelling salesman problem on a path or a tree
Editorial: Glover-Klingman prize
A model of self-avoiding random walks for searching complex networks
A story of diameter, radius, and (almost) Helly property
Approximating survivable networks with minimum number of steiner points
Generalizations of broadcasting and gossiping
Layered cross product - A technique to construct interconnection networks
Autonomous traffic at intersections: An optimization-based analysis of possible time, energy, and CO savings
A cops and robber game and the meeting time of synchronous directed walks
Finding all minimum-size separating vertex sets in a graph
Introductory combinatorics, by K. P. Bogart, Pitman, Boston, 1983, 388 pp. Price: $26.95
An extreme-point tabu-search algorithm for fixed-charge network problems
Sorting common operations to minimize the number of tardy jobs
Localization and scheduling protocols for actor-centric sensor networks
Exact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs
The structure of distances in networks
Polynomial algorithms for estimating network reliability
A continuous-time service network design and vehicle routing problem
A new MILP formulation for the flying sidekick traveling salesman problem
Sufficient conditions for a graph to be lambda k -optimal with given girth and diameter
Bounds on expected performance of networks with links subject to failure
Statistical procedures for estimating branch flows and total network flow
Efficient algorithms for finding maximum cliques of an overlap graph
Renormalization of two - terminal reliability
The searchlight guarding problem on weighted split graphs and weighted cographs
A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves
The complexity of welfare maximization in congestion games
On the existence of N-connected graphs with prescribed degrees (n ≧ 2)
A necessary condition for the existence of a circuit of any specified length
An algebra for determining all path-values in a network with application to K-shortest-paths problems
Editorial: 2011 Glover-Klingman Prize Winners
A Polynomial Time Solvable Capacitated Arc Routing Problem on Regular Grid Graphs
Exact algorithms for the master ring problem
An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks
Hardness of robust network design
Bounding the expected number of rectilinear full Steiner trees
Networks immune to isolated failures
Robust mean absolute deviation problems on networks with linear vertex weights
Maximum flow in networks with a small number of random arc capacities
Exact solutions to the double travelling salesman problem with multiple stacks
Big segment small segment global optimization algorithm on networks
The split delivery capacitated team orienteering problem
Cancel-and-tighten algorithm for quickest flow problems
Preselective strategies for the optimization of stochastic project networks under resource constraints
Balancing two spanning trees
Foundations of applied combinatorics, by Edward A. Bender and S. Gil Williamson, Addison-Wesley, Reading, MA, 1991, 425 pp
Mean-standard deviation model for minimum cost flow problem
A survey of resource constrained shortest path problems: Exact solution approaches
Robust models for linear programming with uncertain right hand side
On the Rabin number problem
A Branch-Price-and-Cut approach for solving the medium-term home health care planning problem
Nonblocking conditions of multicast three-stage interconnection networks
Minimum-diameter covering problems
Efficient Edge-swapping heuristics for the reload cost spanning tree problem
Two-stage stochastic minimum s - t cut problems: Formulations, complexity and decomposition algorithms
The complexity of the capacitated tree problem
Network flows and monotropic optimization, by R. T. Rockafellar, John Wiley & Sons, New York, 616 pp. Price $44.95
Maximum matchings in bipartite graphs via strong spanning trees
On dependence and reliability computations
A capacity scaling algorithm for the constrained maximum flow problem
Stability of networks with distributed and nonlinear elements, part II
Integrating production scheduling and transportation procurement through combinatorial auctions
An aggregation approach to solving the network p-median problem with link demands
A general class of invulnerable graphs
A theorem concerning cyclic directed graphs with applications to network reliability
On the location of a tree-shaped facility
Recognizing small subgraphs
Adversarial models for priority-based networks
Maintaining bipartite matchings in the presence of failures
Stabilizing branch-and-price for constrained tree problems
On optimally solving sub-tree scheduling for wireless sensor networks with partial coverage: A branch-and-cut algorithm
On graphs with polynomially solvable maximum-weight clique problem
Superconnected digraphs and graphs with small conditional diameters
Trucks and drones cooperation in the last-mile delivery process
On the practical importance of asymptotic optimality in certain heuristic algorithms
Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
A property regarding degenerate pivots for linear assignment networks
A two-tier urban delivery network with robot-based deliveries
Reliabilities of chordal rings
Routing with time windows by column generation
A template-based adaptive large neighborhood search for the consistent vehicle routing problem
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
The probabilistic minimum spanning tree problem
Polynomial time algorithms on circular-arc overlap graphs
w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
First-and second-order bounds on terminal reliability
A branch and cut algorithm for the Steiner problem in graphs