A column generation approach and new bounds for the car sequencing problem
type: Item
instance of: scholarly article
title: A column generation approach and new bounds for the car sequencing problem
zbMATH Open document ID: 1390.90466
author: Eivind Jahren
author: Roberto Asín Achá
published in: Annals of Operations Research
publication date: 2018-06-12T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6886494
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: industrial car sequencing
zbMATH Keywords: integer linear programming
zbMATH Keywords: column generation
MaRDI profile type: Publication
full work available at URL: s10479-017-2663-4
OpenAlex ID: W2764248603
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Soft car sequencing with colors: lower bounds and optimality proofs
cites work: Adaptive Restart Strategies for Conflict Driven SAT Solvers
cites work: Greedy approach and multi-criteria simulated annealing for the car sequencing problem
cites work: Two local search approaches for solving real-life car sequencing problems
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Q4418384
cites work: An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
cites work: The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
DOI: 10.1007/S10479-017-2663-4
description: scientific article; zbMATH DE number 6886494