New exact techniques applied to a class of network flow formulations
type: Item
instance of: scholarly article
title: New exact techniques applied to a class of network flow formulations
zbMATH Open document ID: 1482.90228
DOI: 10.1007/978-3-030-73879-2_13
author: Vinícius Loti de Lima
author: Manuel Iori
author: Flávio K. Miyazawa
publication date: 2021-12-21T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7450152
zbMATH Keywords: network flow models
zbMATH Keywords: variable selection
zbMATH Keywords: variable fixing
MaRDI profile type: Publication
full work available at URL: 978-3-030-73879-2 13
OpenAlex ID: W3163972290
cites work: Q3056948
cites work: A first look at picking dual variables for maximizing reduced cost fixing
cites work: Lagrangian bounds from decision diagrams
cites work: Friendly bin packing instances without integer round-up property
cites work: Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
cites work: The Meet-in-the-Middle Principle for Cutting and Packing Problems
cites work: The Decomposition Algorithm for Linear Programs
cites work: Arc flow formulations based on dynamic programming: theoretical foundations and applications
cites work: Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms
cites work: Column Generation
cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
cites work: Path-reduced costs for eliminating arcs in routing and scheduling
cites work: Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
cites work: Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
cites work: Selected Topics in Column Generation
cites work: Q3993418
cites work: Q4040221
cites work: A generic exact solver for vehicle routing and related problems
cites work: Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: A dynamic programming approach for consistency and propagation for knapsack constraints
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
cites work: Branching in branch-and-price: A generic scheme
cites work: On compact formulations for integer programs solved by column generation
cites work: A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
description: scientific article; zbMATH DE number 7450152