LEMON

swMATH5043MaRDI QIDQ17183FDOQ17183

Author name not available (Why is that?)

Described by source

• Minimum-cost flow algorithms: an experimental evaluation

Cited In (53)

• Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
• Preemptive stacker crane problem: extending tree-based properties and construction heuristics
• Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price
• Integrating combinatorial algorithms into a linear programming solver
• Exact algorithms for the equitable traveling salesman problem
• A Benders decomposition algorithm for the maximum availability service facility location problem
• A hybrid optimization approach for the Steiner \(k\)-connected network design problem
• A sparse algorithm for dense optimal transport
• A generic exact solver for vehicle routing and related problems
• Arrival time dependent routing policies in public transport
• Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem
• Sphere intersection 3D shape descriptor (SID)
• An efficiency-based path-scanning heuristic for the capacitated arc routing problem
• Hybrid genetic algorithm for the open capacitated arc routing problem
• The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
• Approximation algorithms in combinatorial scientific computing
• Line planning with user-optimal route choice
• From symmetry to asymmetry: generalizing TSP approximations by parametrization
• Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem
• A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
• Partitioning a graph into balanced connected classes: formulations, separation and experiments
• Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
• Sequential and Parallel Algorithms and Data Structures
• A GRASP for the convex recoloring problem in graphs
• Continuous quadratic programming formulations of optimization problems on graphs
• Integer programming formulations for the elementary shortest path problem
• Lower bounding procedure for the asymmetric quadratic traveling salesman problem
• Robust scheduling of wireless sensor networks for target tracking under uncertainty
• Heuristics for dynamic and stochastic inventory-routing
• Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
• Decomposition algorithms for solving the minimum weight maximal matching problem
• The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands
• PolySCIP
• A sparse multiscale algorithm for dense optimal transport
• Branch and bound algorithms for the bus evacuation problem
• Algorithms and uncertainty sets for data-driven robust shortest path problems
• A bicriteria approach to robust optimization
• Solving resource constrained shortest path problems with LP-based methods
• Sequence analysis and modern C++. The creation of the SeqAn3 bioinformatics library
• Minimum energy target tracking with coverage guarantee in wireless sensor networks
• Risk-averse shortest path interdiction
• The matching relaxation for a class of generalized set partitioning problems
• An efficient primal-dual algorithm for fair combinatorial optimization problems
• Liner shipping service scheduling and cargo allocation
• A branch and cut algorithm for minimum spanning trees under conflict constraints
• Diffusion pruning for rapidly and robustly selecting global correspondences using local isometry
• VF2++ -- an improved subgraph isomorphism algorithm
• Efficient matching for column intersection graphs
• A multi-scale UAV image matching method applied to large-scale landslide reconstruction
• A biased random-key genetic algorithm for the set orienteering problem
• A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks
• Constrained shortest path tour problem: branch-and-price algorithm
• Polyhedral Results and Branch-and-Cut for the Resource Loading Problem

This page was built for software: LEMON