A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379): Difference between revisions

Latest revision as of 04:31, 30 July 2024

scientific article; zbMATH DE number 7587535

Language	Label	Description	Also known as
English	A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation	scientific article; zbMATH DE number 7587535

Statements

instance of

scholarly article

0 references

title

A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (English)

0 references

zbMATH Open document ID

1497.90041

0 references

DOI

10.1287/opre.2021.2126

0 references

0 references

0 references

0 references

19 September 2022

0 references

full work available at URL

https://arxiv.org/abs/2004.13758

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

vehicle platooning

0 references

valid inequalities

0 references

vehicle routing problems

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Capacitated Facility Location: Valid Inequalities and Facets

0 references

Lift and project relaxations for the matching and related polytopes

0 references

On the facets of the mixed-integer knapsack polyhedron

0 references

Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem

0 references

A Comprehensive Analysis of Polyhedral Lift-and-Project Methods

0 references

A modified lift-and-project procedure

0 references

Disjunctive programming: Properties of the convex hull of feasible points

0 references

Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs

0 references

Lifting theorems and facet characterization for a class of clique partitioning inequalities

0 references

The Continuous-Time Service Network Design Problem

0 references

Solving Lift-and-Project Relaxations of Binary Integer Programs

0 references

Integer Programming

0 references

Fourier-Motzkin elimination and its dual

0 references

Formulations and valid inequalities of the node capacitated graph partitioning problem

0 references

Dynamic graph generation for the shortest path problem in time expanded networks

0 references

Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs

0 references

Time-dependent routing problems: a review

0 references

Facets of the clique partitioning polytope

0 references

Lifted Cover Inequalities for 0-1 Integer Programs: Complexity

0 references

Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs

0 references

The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut

0 references

Q4132247

0 references

Lift-and-project cuts for convex mixed integer nonlinear programs

0 references

A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching

0 references

Robust network design: Formulations, valid inequalities, and computations

0 references

On mixing sets arising in chance-constrained programming

0 references

On disjunctive cuts for combinatorial optimization

0 references

Lifting, superadditivity, mixed integer rounding and single node flow sets revisited

0 references

The clique partitioning problem: Facets and patching facets

0 references

New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows

0 references

New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem

0 references

Lot-Sizing with Constant Batches: Formulation and Valid Inequalities

0 references

Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms

0 references

Integration over a Polyhedron: An Application of the Fourier-Motzkin Elimination Method

0 references

An Introduction to Network Flows over Time

0 references

Fourier-Motzkin elimination extension to integer programming problems

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5106379

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3196159362
@@ Property / OpenAlex ID: W3196159362 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.13758
@@ Property / arXiv ID: 2004.13758 / rank @@
+Normal rank
@@ Property / cites work @@
+Capacitated Facility Location: Valid Inequalities and Facets
+Normal rank
@@ Property / cites work @@
+Lift and project relaxations for the matching and related polytopes
+Normal rank
@@ Property / cites work @@
+On the facets of the mixed-integer knapsack polyhedron
+Normal rank
@@ Property / cites work @@
+Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem
+Normal rank
@@ Property / cites work @@
+A Comprehensive Analysis of Polyhedral Lift-and-Project Methods
+Normal rank
@@ Property / cites work @@
+A modified lift-and-project procedure
@@ Property / cites work: A modified lift-and-project procedure / rank @@
+Normal rank
@@ Property / cites work @@
+Disjunctive programming: Properties of the convex hull of feasible points
+Normal rank
@@ Property / cites work @@
+Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs
+Normal rank
@@ Property / cites work @@
+Lifting theorems and facet characterization for a class of clique partitioning inequalities
+Normal rank
@@ Property / cites work @@
+The Continuous-Time Service Network Design Problem
+Normal rank
@@ Property / cites work @@
+Solving Lift-and-Project Relaxations of Binary Integer Programs
+Normal rank
@@ Property / cites work @@
+Integer Programming
@@ Property / cites work: Integer Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Fourier-Motzkin elimination and its dual
@@ Property / cites work: Fourier-Motzkin elimination and its dual / rank @@
+Normal rank
@@ Property / cites work @@
+Formulations and valid inequalities of the node capacitated graph partitioning problem
+Normal rank
@@ Property / cites work @@
+Dynamic graph generation for the shortest path problem in time expanded networks
+Normal rank
@@ Property / cites work @@
+Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
+Normal rank
@@ Property / cites work @@
+Time-dependent routing problems: a review
@@ Property / cites work: Time-dependent routing problems: a review / rank @@
+Normal rank
@@ Property / cites work @@
+Facets of the clique partitioning polytope
@@ Property / cites work: Facets of the clique partitioning polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
+Normal rank
@@ Property / cites work @@
+Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
+Normal rank
@@ Property / cites work @@
+The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
+Normal rank
@@ Property / cites work @@
+Q4132247
@@ Property / cites work: Q4132247 / rank @@
+Normal rank
@@ Property / cites work @@
+Lift-and-project cuts for convex mixed integer nonlinear programs
+Normal rank
@@ Property / cites work @@
+A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching
+Normal rank
@@ Property / cites work @@
+Robust network design: Formulations, valid inequalities, and computations
+Normal rank
@@ Property / cites work @@
+On mixing sets arising in chance-constrained programming
+Normal rank
@@ Property / cites work @@
+On disjunctive cuts for combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
+Normal rank
@@ Property / cites work @@
+The clique partitioning problem: Facets and patching facets
+Normal rank
@@ Property / cites work @@
+New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem
+Normal rank
@@ Property / cites work @@
+Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
+Normal rank
@@ Property / cites work @@
+Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
+Normal rank
@@ Property / cites work @@
+Integration over a Polyhedron: An Application of the Fourier-Motzkin Elimination Method
+Normal rank
@@ Property / cites work @@
+An Introduction to Network Flows over Time
@@ Property / cites work: An Introduction to Network Flows over Time / rank @@
+Normal rank
@@ Property / cites work @@
+Fourier-Motzkin elimination extension to integer programming problems
+Normal rank