A set partitioning reformulation of a school bus scheduling problem
type: Item
instance of: scholarly article
title: A set partitioning reformulation of a school bus scheduling problem
zbMATH Open document ID: 1229.90058
author: Armin Fügenschuh
published in: Journal of Scheduling
publication date: 2012-01-16T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5997877
zbMATH Keywords: integer linear programming
zbMATH Keywords: single-depot vehicle scheduling with time windows
zbMATH Keywords: IP2
zbMATH Keywords: set partitioning
zbMATH Keywords: cutting planes
describes a project that uses: CPLEX
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: s10951-011-0234-0
OpenAlex ID: W2088589818
cites work: On the solution of traveling salesman problems
cites work: A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables Per Inequality
cites work: Efficient algorithms for integer programs with two variables per constraint.
cites work: Q5301728
cites work: Q4532226
cites work: Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
cites work: Q4532229
cites work: Selected Topics in Column Generation
cites work: Q5687193
cites work: Q3378422
cites work: The vehicle routing problem with coupled time windows
cites work: Solving a school bus scheduling problem with integer programming
cites work: A multicriteria approach for optimizing bus schedules and school starting times
cites work: Blocking and anti-blocking pairs of polyhedra
cites work: Q4198056
cites work: Geometric algorithms and combinatorial optimization
cites work: Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
cites work: Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
cites work: Optimierung des Schülerverkehrs durch gemischt ganzzahlige Programmierung
cites work: The Computational Complexity of Simultaneous Diophantine Approximation Problems
cites work: Towards a Genuinely Polynomial Algorithm for Linear Programming
cites work: On the facial structure of set packing polyhedra
cites work: Deciding Linear Inequalities by Computing Loop Residues
cites work: The vehicle routing problem
DOI: 10.1007/S10951-011-0234-0
description: scientific article; zbMATH DE number 5997877