Results 1 to 10 of about 1,530,542 (289)
Column generation for extended formulations [PDF]
EURO 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
A hybrid VNS matheuristic for a bin packing problem with a color constraint [PDF]
Yugoslav 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
Algorithms, 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
Algorithms, 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
Algorithms, 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
Generalized Column Distances [PDF]
IEEE 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
ONE-DIMENSIONAL CUTTING STOCK PROBLEM THAT MINIMIZES THE NUMBER OF DIFFERENT PATTERNS
Barekeng, 2022 Cutting stock problem (CSP) is a problem of cutting an object into several smaller objects to fulfill the existing demand with a minimum unused object remaining.
Bib Paruhum Silalahi +3 more
doaj +1 more source
Asynchronous Column Generation [PDF]
2017 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
Family Column Generation: A Principled Stabilized Column Generation Approach
, 2021 We tackle the problem of accelerating column generation (CG) approaches to set cover formulations in operations research. At each iteration of CG we generate a dual solution that approximately solves the LP over all columns consisting of a subset of columns in the nascent set. We refer to this linear program (LP) as the Family Restricted Master Problem
Haghani, Naveen +2 more
openaire +2 more sources
IEEE Access, 2020 Considering the characteristics of China's high-speed railway network and the allocation structure of Electric Multiple Units (EMUs), the EMUs operation management mode provides an effective technical route for EMUs route planning optimization. To reduce
Wen-Jun Li +4 more
doaj +1 more source