Results 1 to 10 of about 440,308 (260)

Column generation for extended formulations [PDF]

open access: yesEURO Journal on Computational Optimization, 2013
Working in an extended variable space allows one to develop tighter reformulations for mixed integer programs. However, the size of the extended formulation grows rapidly too large for a direct treatment by a MIP-solver.
Ruslan Sadykov, François Vanderbeck
doaj   +4 more sources

Selected Topics in Column Generation [PDF]

open access: yesOperations Research, 2005
Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a success story in large-scale integer programming. We outline and relate the approaches, and survey mainly recent contributions, not yet found in textbooks. We emphasize the growing understanding of the dual point of view, which has brought considerable progress to the
Marco Lübbecke, Jacques Desrosiers
exaly   +2 more sources

Generalized Column Generation for Linear Programming [PDF]

open access: yesManagement Science, 2002
Column generation is a well-known and widely practiced technique for solving linear programs with too many variables or constraints to include in the initial formulation explicitly. Instead, the required column information is generated at each iteration of the simplex algorithm.
exaly   +3 more sources

Generalized Column Distances [PDF]

open access: yesIEEE Transactions on Information Theory, 2020
The notion of Generalized Hamming weights of block codes has been investigated since the nineties due to its significant role in coding theory and cryptography. In this paper we extend this concept to the context of convolutional codes. In particular, we focus on column distances and introduce the novel notion of generalized column distances (GCD).
Sara D. Cardell   +2 more
openaire   +2 more sources

A hybrid VNS matheuristic for a bin packing problem with a color constraint [PDF]

open access: yesYugoslav Journal of Operations Research, 2021
We study a new variant of the bin packing problem with a color constraint. Given a finite set of items, each item has a set of colors. Each bin has a color capacity, the total number of colors for a bin is the unification of colors for its items and ...
Kochetov Yury, Kondakov Arteam
doaj   +1 more source

Matheuristics and Column Generation for a Basic Technician Routing Problem

open access: yesAlgorithms, 2021
This paper considers a variant of the Vehicle Routing Problem with Time Windows, with site dependencies, multiple depots and outsourcing costs. This problem is the basis for many technician routing problems.
Nicolas Dupin   +2 more
doaj   +1 more source

Generalized column distances

open access: yesCoRR, 2022
We define a notion of r-generalized column distances for the j-truncation of a convolutional code. Taking the limit as j tends to infinity allows us to define r-generalized column distances of a convolutional code. We establish some properties of these invariants and compare them with other invariants of convolutional codes which appear in the ...
Elisa Gorla, Flavio Salizzoni
openaire   +2 more sources

Branch and Price Algorithm for Multi-Trip Vehicle Routing with a Variable Number of Wagons and Time Windows

open access: yesAlgorithms, 2022
Motivated by the transportation needs of modern-day retailers, we consider a variant of the vehicle routing problem with time windows in which each truck has a variable capacity. In our model, each vehicle can bring one or more wagons.
Leila Karimi, Chowdhury Nawrin Ferdous
doaj   +1 more source

Computational Performance Evaluation of Column Generation and Generate-and-Solve Techniques for the One-Dimensional Cutting Stock Problem

open access: yesAlgorithms, 2022
The Cutting Stock Problem (CSP) is an optimisation problem that roughly consists of cutting large objects in order to produce small items. The computational effort for solving this problem is largely affected by the number of cutting patterns.
José Victor Sá Santos   +1 more
doaj   +1 more source

Asynchronous Column Generation [PDF]

open access: yes2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 2017
In this paper we face a very fundamental problem in Operations Research: to find good dual bounds to generic mixed integer mathematical programs (MIPs) as quickly as possible. In particular, we focus on the scenario where large scale data needs to be considered, multicore CPU architectures are available, and massive parallelism can be exploited by ...
S. Basso, A. Ceselli
openaire   +2 more sources

Home - About - Disclaimer - Privacy