Optimizing cooperative carrier-vehicle routing with iterative second-order cone programming method
From MaRDI portal
Cites work
- A multi-objective humanitarian pickup and delivery vehicle routing problem with drones
- An arc search interior-point algorithm for monotone linear complementarity problems over symmetric cones
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An efficient second-order cone programming approach for optimal selection in tree breeding
- An optimal path planning problem for heterogeneous multi-vehicle systems
- Applications of second-order cone programming
- Collaborative truck multi-drone delivery system considering drone scheduling and en route operations
- Conic relaxation approaches for equal deployment problems
- Euclidean Jordan algebras and interior-point algorithms
- Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- New benchmark instances for the capacitated vehicle routing problem
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Polyhedral-based methods for mixed-integer SOCP in tree breeding
- Second-order cone programming
- The rendezvous vehicle routing problem
This page was built for publication: Optimizing cooperative carrier-vehicle routing with iterative second-order cone programming method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7317886)
