The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach (Q320623): Difference between revisions

Latest revision as of 15:55, 12 July 2024

scientific article

Language	Label	Description	Also known as
English	The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach	scientific article

Statements

instance of

scholarly article

0 references

title

The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach (English)

0 references

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

7 October 2016

0 references

zbMATH Keywords

traveling purchaser problem

0 references

multi-vehicle

0 references

pairwise incompatibility constraints

0 references

column generation

0 references

branch-and-price

0 references

describes a project that uses

LKH

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2015.06.073

0 references

cites work

Exploring greedy criteria for the dynamic traveling purchaser problem

0 references

Branch-and-Price: Column Generation for Solving Huge Integer Programs

0 references

A stochastic programming approach for the traveling purchaser problem

0 references

The distance constrained multiple vehicle traveling purchaser problem

0 references

Q3048582

0 references

Decomposition Principle for Linear Programs

0 references

Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows

0 references

Q2776562

0 references

Stabilized column generation

0 references

Solving the Orienteering Problem through Branch-and-Cut

0 references

Heuristics and lower bounds for the bin packing problem with conflicts

0 references

The transportation problem with exclusionary side constraints

0 references

An effective implementation of the Lin-Kernighan traveling salesman heuristic

0 references

Routing problems with loading constraints

0 references

Shortest Path Problems with Resource Constraints

0 references

A column generation approach for the split delivery vehicle routing problem

0 references

A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem

0 references

The traveling purchaser problem with budget constraint

0 references

Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach

0 references

A column generation approach for a school bus routing problem with resource constraints

0 references

Interior point stabilization for column generation

0 references

The transportation problem with exclusionary side constraints and two branch-and-bound algorithms

0 references

Dynamic tabu search strategies for the traveling purchaser problem

0 references

Identifiers

zbMATH Open document ID

1346.90112

0 references

DOI

10.1016/j.ejor.2015.06.073

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:320623

@@ Property / cites work @@
+Exploring greedy criteria for the dynamic traveling purchaser problem
+Normal rank
@@ Property / cites work @@
+Branch-and-Price: Column Generation for Solving Huge Integer Programs
+Normal rank
@@ Property / cites work @@
+A stochastic programming approach for the traveling purchaser problem
+Normal rank
@@ Property / cites work @@
+The distance constrained multiple vehicle traveling purchaser problem
+Normal rank
@@ Property / cites work @@
+Q3048582
@@ Property / cites work: Q3048582 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition Principle for Linear Programs
@@ Property / cites work: Decomposition Principle for Linear Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+Q2776562
@@ Property / cites work: Q2776562 / rank @@
+Normal rank
@@ Property / cites work @@
+Stabilized column generation
@@ Property / cites work: Stabilized column generation / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the Orienteering Problem through Branch-and-Cut
+Normal rank
@@ Property / cites work @@
+Heuristics and lower bounds for the bin packing problem with conflicts
+Normal rank
@@ Property / cites work @@
+The transportation problem with exclusionary side constraints
+Normal rank
@@ Property / cites work @@
+An effective implementation of the Lin-Kernighan traveling salesman heuristic
+Normal rank
@@ Property / cites work @@
+Routing problems with loading constraints
@@ Property / cites work: Routing problems with loading constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest Path Problems with Resource Constraints
@@ Property / cites work: Shortest Path Problems with Resource Constraints / rank @@
+Normal rank
@@ Property / cites work @@
+A column generation approach for the split delivery vehicle routing problem
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
+Normal rank
@@ Property / cites work @@
+The traveling purchaser problem with budget constraint
+Normal rank
@@ Property / cites work @@
+Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
+Normal rank
@@ Property / cites work @@
+A column generation approach for a school bus routing problem with resource constraints
+Normal rank
@@ Property / cites work @@
+Interior point stabilization for column generation
+Normal rank
@@ Property / cites work @@
+The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
+Normal rank
@@ Property / cites work @@
+Dynamic tabu search strategies for the traveling purchaser problem
+Normal rank