The following pages link to LEMON (Q17183):
Displaying 50 items.
- Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
- Robust scheduling of wireless sensor networks for target tracking under uncertainty (Q322906) (← links)
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- A sparse multiscale algorithm for dense optimal transport (Q334276) (← links)
- Branch and bound algorithms for the bus evacuation problem (Q336688) (← links)
- Heuristics for dynamic and stochastic inventory-routing (Q337178) (← links)
- A bicriteria approach to robust optimization (Q342179) (← links)
- Solving resource constrained shortest path problems with LP-based methods (Q342436) (← links)
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
- Arrival time dependent routing policies in public transport (Q1627847) (← links)
- Sphere intersection 3D shape descriptor (SID) (Q1632374) (← links)
- An efficiency-based path-scanning heuristic for the capacitated arc routing problem (Q1634089) (← links)
- Algorithms and uncertainty sets for data-driven robust shortest path problems (Q1634306) (← links)
- The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
- Hybrid genetic algorithm for the open capacitated arc routing problem (Q1652524) (← links)
- Minimum energy target tracking with coverage guarantee in wireless sensor networks (Q1681141) (← links)
- An efficient primal-dual algorithm for fair combinatorial optimization problems (Q1699796) (← links)
- Liner shipping service scheduling and cargo allocation (Q1719622) (← links)
- Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price (Q1725820) (← links)
- A hybrid optimization approach for the Steiner \(k\)-connected network design problem (Q1742248) (← links)
- VF2++ -- an improved subgraph isomorphism algorithm (Q1744243) (← links)
- Line planning with user-optimal route choice (Q1751827) (← links)
- Exact algorithms for the equitable traveling salesman problem (Q1753595) (← links)
- A multi-scale UAV image matching method applied to large-scale landslide reconstruction (Q1981205) (← links)
- Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem (Q2014365) (← links)
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation (Q2025063) (← links)
- Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem (Q2027061) (← links)
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (Q2029899) (← links)
- Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323) (← links)
- A biased random-key genetic algorithm for the set orienteering problem (Q2030452) (← links)
- Preemptive stacker crane problem: extending tree-based properties and construction heuristics (Q2030604) (← links)
- Sequence analysis and modern C++. The creation of the SeqAn3 bioinformatics library (Q2057555) (← links)
- A Benders decomposition algorithm for the maximum availability service facility location problem (Q2108127) (← links)
- A GRASP for the convex recoloring problem in graphs (Q2132370) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q2140484) (← links)
- Constrained shortest path tour problem: branch-and-price algorithm (Q2147106) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077) (← links)
- Integrating combinatorial algorithms into a linear programming solver (Q2418164) (← links)
- Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
- The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands (Q2664291) (← links)
- Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
- PolySCIP (Q2819226) (← links)
- Efficient Matching for Column Intersection Graphs (Q2828179) (← links)
- Risk-Averse Shortest Path Interdiction (Q2830955) (← links)
- A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks (Q2835682) (← links)
- A sparse algorithm for dense optimal transport (Q3300344) (← links)
- Polyhedral Results and Branch-and-Cut for the Resource Loading Problem (Q4995060) (← links)
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem (Q5131709) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
