Accelerating the branch-and-price algorithm using machine learning
type: Item
instance of: scholarly article
title: Accelerating the branch-and-price algorithm using machine learning
zbMATH Open document ID: 1403.90372
author: Roman Václavík
author: Antonín Novák
author: Přemysl Šůcha
author: Zdeněk Hanzálek
published in: European Journal of Operational Research
publication date: 2018-08-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6913733
zbMATH Keywords: scheduling
zbMATH Keywords: branch-and-price
zbMATH Keywords: pricing problem
zbMATH Keywords: machine learning
zbMATH Keywords: upper bound
describes a project that uses: PMTK
describes a project that uses: VRP
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.05.046
OpenAlex ID: W2804168480
cites work: Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
cites work: A proximal trust-region algorithm for column generation stabilization
cites work: A branch-and-price algorithm for the robust graph coloring problem
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: New approaches to nurse rostering benchmark instances
cites work: The state of the art of nurse rostering
cites work: Ship routing and scheduling in the new millennium
cites work: Branch-and-price and constraint programming for solving a real-life technician dispatching problem
cites work: Generating Multiple Solutions for Mixed Integer Programming Problems
cites work: A branch-and-price approach for a multi-period vehicle routing problem
cites work: Branch-and-price for staff rostering: an efficient implementation using generic programming and nested column generation
cites work: Nurse scheduling with tabu search and strategic oscillation
cites work: A tutorial on column generation and branch-and-price for vehicle routing problems
cites work: An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems
cites work: Information-theoretic approaches to branching in search
cites work: An effective architecture for learning and evolving flexible job-shop schedules
cites work: Fractional knapsack problems
cites work: Reducibility among Combinatorial Problems
cites work: Selected Topics in Column Generation
cites work: Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem
cites work: Machine learning. A probabilistic perspective
cites work: Q3439711
cites work: Q3394879
cites work: A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
cites work: Measuring instance difficulty for combinatorial optimization problems
cites work: Combining metaheuristics with mathematical programming, constraint programming and machine learning
cites work: Vehicle Routing
cites work: Q4935997
cites work: Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price
Wikidata QID: Q129767475
DOI: 10.1016/J.EJOR.2018.05.046
description: scientific article; zbMATH DE number 6913733