• CVRPSP

  • Referenced in 129 articles [sw13447]
  • Algorithm for the Capacitated Vehicle Routing Problem” (by Lysgaard, Letchford, and Eglese, published in Mathematical ... rounded capacity inequalities, homogeneous multistar inequalities, generalized multistar inequalities, framed capacity inequalities, strengthened comb inequalities...
  • Graphs

  • Referenced in 107 articles [sw12277]
  • generalization of the classical single-source (SSSP) and all-pairs shortest-path (APSP) problems ... transportation, networking, and social science, this problem has been considered by researchers from various communities ... under different names): algorithm engineers construct fast route planning methods; database and information systems researchers ... sparse spanners. Related problems are considered for compact routing and distance labeling schemes in networking...
  • CVRPSEP

  • Referenced in 40 articles [sw11809]
  • Algorithm for the Capacitated Vehicle Routing Problem” (by Lysgaard, Letchford, and Eglese, published in Mathematical ... rounded capacity inequalities, homogeneous multistar inequalities, generalized multistar inequalities, framed capacity inequalities, strengthened comb inequalities...
  • CLOVES

  • Referenced in 12 articles [sw02698]
  • This paper addresses the vehicle routing problem with sequence-constrained delivery and pick-up (VRPDP ... along a route using shrink-wrap algorithm and allots vehicles using generalized assignment procedure ... Trials on a large number of test-problems have yielded encouraging results...
  • HyFlex

  • Referenced in 12 articles [sw07688]
  • designing adaptive general-purpose optimisation algorithms. Six hard combinatorial problems are fully implemented: maximum satisfiability ... shop, personnel scheduling, traveling salesman and vehicle routing. Each domain contains a varied ... extensive set of state-of-the-art problem specific heuristics and search operators. HyFlex represents ... valuable new benchmark of heuristic search generality, with which adaptive cross-domain algorithms are being...
  • MIRPLib

  • Referenced in 19 articles [sw11220]
  • deterministic single product Maritime Inventory Routing Problems (MIRPs), which we call deep-sea MIRPs with ... integer linear program. This formulation is quite general and incorporates assumptions and families of constraints ... these problems. Finally, we present a library, called MIRPLib, of publicly available test problem instances ... port. Despite a growing interest in combined routing and inventory management problems in a maritime...
  • HGS-CVRP

  • Referenced in 4 articles [sw41497]
  • vehicle routing problem (CVRP). This state-of-the-art algorithm uses the same general methodology ... consists in exchanging two customers between different routes without an insertion in place. As highlighted...
  • ODEA

  • Referenced in 3 articles [sw07671]
  • particular telecommunication networks and automated vehicle routing. The main motivation typically is the desire ... Containerterminal Altenwerder at Hamburg harbour. Disjoint Paths Problems are posed in the form ... minimum among all solutions. This problem is known to be NP-hard even in very ... modelling technique called arc dependences. It generalizes the traditional notion of disjointness which differentiates between...
  • PortLib

  • Referenced in 1 article [sw37941]
  • paper An ALNS Heuristic for Routing and Scehduling Feeder Vessels in Multi-terminal Ports, written ... Pisinger. The PSP represents a new scheduling problem for feeder vessels in multi-terminal ports ... with the industry. The proposed problem is a General Shop-like problem, and it accounts...
  • RESCU

  • Referenced in 3 articles [sw18285]
  • computational efficiency is achieved from exploiting four routes. First, we use numerical atomic orbital ... accurately the KS equation using eigensolvers can generally be avoided. Third, by judiciously analyzing ... power of RESCU in solving KS-DFT problems using many examples running...
  • BARON

  • Referenced in 354 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • CDT

  • Referenced in 12 articles [sw00116]
  • Algorithm 750: CDT: A subroutine for the exact...
  • Coq

  • Referenced in 1888 articles [sw00161]
  • Coq is a formal proof management system. It...
  • GLOB

  • Referenced in 37 articles [sw00357]
  • GLOB -- a new VNS-based software for global...
  • Isabelle

  • Referenced in 710 articles [sw00454]
  • Isabelle is a generic proof assistant. It allows...
  • KNITRO

  • Referenced in 196 articles [sw00490]
  • KNITRO is a solver for nonlinear optimization. It...
  • LANCELOT

  • Referenced in 306 articles [sw00500]
  • LANCELOT. A Fortran package for large-scale nonlinear...
  • LGS

  • Referenced in 15 articles [sw00517]
  • In the paper we present LGS -- a geometric...
  • Maple

  • Referenced in 5369 articles [sw00545]
  • The result of over 30 years of cutting...