Results 11 to 20 of about 609,732 (141)
Dantzig-Wolfe and Lagrangian decompositions in integer linear programming
, 2011 International audienceWe propose in this paper a new Dantzig-Wolfe master model based on Lagrangian decomposition. We establish the relationship with classical Dantzig-Wolfe decomposition master problem and propose an alternative proof of the dominance ...
Touati Moungla, Nora +3 more
core +5 more sources
A Stabilized Structured Dantzig-Wolfe Decomposition Method [PDF]
, 2013 We discuss an algorithmic scheme, which we call the stabilized structured Dantzig-Wolfe decomposition method, for solving large-scale structured linear programs.
FRANGIONI, ANTONIO, B. GENDRON
core +1 more source
Dantzig-Wolfe Decomposition for Cost Partitioning [PDF]
, 2021 Optimal cost partitioning can produce high quality heuristic estimates even from small abstractions. It can be computed with a linear program (LP) but the size of this LP often makes this impractical. Recent work used Lagrangian decomposition to speed up
Pommerening, Florian, +10 more
core +1 more source
Shipping optimization systems (SOS) for tramp: stochastic cargo soft time windows
Journal of Shipping and Trade, 2021 Cargo time windows have been discussed in the shipping literature in several ways and within several contexts. One way considers the hard time windows, where a fixed date is assigned to both the open and close laycan for the cargo loading and discharging
Said El Noshokaty
doaj +1 more source
One-parametric analysis of column-oriented linear programs
Operations Research Perspectives, 2023 A linear optimization problem which is amenable to column generation and contains a single parameter in the objective function is considered. We extend and adapt the standard linear programming column generation scheme to effectively and efficiently ...
Torbjörn Larsson, Nils-Hassan Quttineh
doaj +1 more source
Two extended formulations for the virtual network function placement and routing problem
Networks, Volume 82, Issue 1, Page 32-51, July 2023., 2023 Abstract Given a bi‐directed graph modeling a telecommunication network, and a set of origin‐destination pairs representing traffic requests (commodities) along with their associated Service Function Chains (SFCs), the Virtual Network Function Placement and Routing Problem (VNFPRP) aims to find, for each commodity, one latency‐constrained routing path ...
Ahlam Mouaci +3 more
wiley +1 more source
A Branch-and-Price Algorithm for Balancing Two-Sided Assembly Lines with Zoning Constraints
Journal of Mathematics, 2021 Two-sided assembly lines are widely used in the large-size product manufacturing industry, especially for automotive assembly production. Balancing the assembly line is significant for assembly process planning and assembly production.
Qidong Yin +2 more
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
IEEE Access, 2020 The Fifth Generation (5G) New Radio (NR) Physical Layer (PHY) is designed to successfully address diverse user and service requirements by providing a highly flexible framework. This flexibility is viable through a scalable numerology.
Ljiljana Marijanovic +2 more
doaj +1 more source
Replication data for 'A data driven Dantzig–Wolfe decomposition framework'
, 2022 The dataset contains a set of about 31000 random decompositions of MIPLib instances, together with (a) an evaluation of a set of 121 features over them (b) bound and time scores, obtained through optimization runs.
Basso, Saverio, Ceselli, Alberto
core +1 more source