LEMON
From MaRDI portal
Cited in
(89)- PALADIN
- SeqLib
- libsequence
- Mason
- Taxator-tk
- FLEXBAR
- shiki
- PushRelabelMaxFlow
- Python-Louvain
- LocalGraphClustering
- SNDlib
- Arrival time dependent routing policies in public transport
- Sphere intersection 3D shape descriptor (SID)
- An efficiency-based path-scanning heuristic for the capacitated arc routing problem
- Algorithms and uncertainty sets for data-driven robust shortest path problems
- The matching relaxation for a class of generalized set partitioning problems
- Hybrid genetic algorithm for the open capacitated arc routing problem
- Minimum energy target tracking with coverage guarantee in wireless sensor networks
- An efficient primal-dual algorithm for fair combinatorial optimization problems
- Liner shipping service scheduling and cargo allocation
- Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price
- MCF
- RelaxIV
- A hybrid optimization approach for the Steiner k-connected network design problem
- VF2++ -- an improved subgraph isomorphism algorithm
- Line planning with user-optimal route choice
- Exact algorithms for the equitable traveling salesman problem
- JGraphT
- A multi-scale UAV image matching method applied to large-scale landslide reconstruction
- Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
- 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
- A biased random-key genetic algorithm for the set orienteering problem
- Preemptive stacker crane problem: extending tree-based properties and construction heuristics
- Sequence analysis and modern C++. The creation of the SeqAn3 bioinformatics library
- A Benders decomposition algorithm for the maximum availability service facility location problem
- A GRASP for the convex recoloring problem in graphs
- From symmetry to asymmetry: generalizing TSP approximations by parametrization
- Constrained shortest path tour problem: branch-and-price algorithm
- A generic exact solver for vehicle routing and related problems
- A branch and cut algorithm for minimum spanning trees under conflict constraints
- LinTim
- SiftGPU
- Integrating combinatorial algorithms into a linear programming solver
- MCFSimplex
- CS2
- RanGen
- Continuous quadratic programming formulations of optimization problems on graphs
- The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands
- Chabot
- PolySCIP
- Decomposition algorithms for solving the minimum weight maximal matching problem
- PolySCIP
- Efficient matching for column intersection graphs
- Risk-averse shortest path interdiction
- A set covering approach for the double traveling salesman problem with multiple stacks
- DOTmark
- Integer programming formulations for the elementary shortest path problem
- Robust scheduling of wireless sensor networks for target tracking under uncertainty
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem
- A sparse algorithm for dense optimal transport
- A sparse multiscale algorithm for dense optimal transport
- Branch and bound algorithms for the bus evacuation problem
- Heuristics for dynamic and stochastic inventory-routing
- A bicriteria approach to robust optimization
- Solving resource constrained shortest path problems with LP-based methods
- RAPSearch2
- AWK
- VF2++
- SGTlight
- Matchbox
- Bioconda
- mmgraph
- BUbiNG
- openMVG
- PCM
- Polyhedral results and branch-and-cut for the resource loading problem
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
- Approximation algorithms in combinatorial scientific computing
- Sequential and parallel algorithms and data structures. The basic toolbox
- GenomeTools
- Diffusion pruning for rapidly and robustly selecting global correspondences using local isometry
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- LD-davol
- Conefor Sensinode
- MALT
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
This page was built for software: LEMON
