Výsledky vyhľadávania - Mixed integer programming Dantzig-Wolfe decomposition Reformulation
-
1
Classification of Dantzig–Wolfe reformulations for binary mixed integer programming problems
ISSN: 0377-2217, 1872-6860Vydavateľské údaje: Amsterdam Elsevier B.V 16.07.2010Vydané v European journal of operational research (16.07.2010)“…In this note, we provide a classification of Dantzig–Wolfe reformulations for Binary Mixed Integer Programming Problems…”
Získať plný text
Journal Article -
2
A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
ISSN: 0030-364X, 1526-5463Vydavateľské údaje: Linthicum, MD INFORMS 01.09.2007Vydané v Operations research (01.09.2007)“…Although the textbook Dantzig-Wolfe decomposition reformulation for the capacitated lot-sizing problem, as already proposed by Manne [Manne, A. S. 1958…”
Získať plný text
Journal Article -
3
Automatic Dantzig–Wolfe reformulation of mixed integer programs
ISSN: 0025-5610, 1436-4646Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2015Vydané v Mathematical programming (01.02.2015)“…Dantzig–Wolfe decomposition (or reformulation) is well-known to provide strong dual bounds for specially structured mixed integer programs (MIPs…”
Získať plný text
Journal Article -
4
Solving the Temporal Knapsack Problem via Recursive Dantzig–Wolfe Reformulation
ISSN: 0020-0190, 1872-6119Vydavateľské údaje: Amsterdam Elsevier B.V 01.05.2016Vydané v Information processing letters (01.05.2016)“… only. In this paper we solve the TKP using what we call a Recursive Dantzig–Wolfe Reformulation (DWR) method…”
Získať plný text
Journal Article -
5
Dantzig–Wolfe reformulations for binary quadratic problems
ISSN: 1867-2949, 1867-2957Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2022Vydané v Mathematical programming computation (01.03.2022)“… We propose a first methodological analysis on a family of reformulations combining Dantzig…”
Získať plný text
Journal Article -
6
A data driven Dantzig–Wolfe decomposition framework
ISSN: 1867-2949, 1867-2957Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2023Vydané v Mathematical programming computation (01.03.2023)“… algebraic structure of the MIP instance. We propose to employ Dantzig–Wolfe reformulation and machine learning methods to obtain a fully data driven automatic decomposition framework…”
Získať plný text
Journal Article -
7
Dantzig-Wolfe decomposition for the facility location and production planning problem
ISSN: 0305-0548, 0305-0548Vydavateľské údaje: New York Elsevier Ltd 01.12.2020Vydané v Computers & operations research (01.12.2020)“…•We analyze the relationship between these models and Dantzig-Wolfe decomposition reformulations…”
Získať plný text
Journal Article -
8
Price-and-verify: a new algorithm for recursive circle packing using Dantzig–Wolfe decomposition
ISSN: 0254-5330, 1572-9338Vydavateľské údaje: New York Springer US 01.01.2020Vydané v Annals of operations research (01.01.2020)“…–Wolfe reformulation of a nonconvex mixed-integer nonlinear programming formulation. The key idea of this reformulation is to break symmetry on each recursion level by enumerating one-level packings, i.e…”
Získať plný text
Journal Article -
9
A generic view of Dantzig–Wolfe decomposition in mixed integer programming
ISSN: 0167-6377, 1872-7468Vydavateľské údaje: Amsterdam Elsevier B.V 2006Vydané v Operations research letters (2006)“…The Dantzig–Wolfe reformulation principle is presented based on the concept of generating sets…”
Získať plný text
Journal Article -
10
A near-optimal solution method for coordinated operation planning problem of power- and heat-interchange networks using column generation-based decomposition
ISSN: 0360-5442, 1873-6785Vydavateľské údaje: Oxford Elsevier Ltd 15.04.2020Vydané v Energy (15.04.2020)“… efficiency and scalability. The coordinated operation-planning problem, based on a mixed-integer linear programming (MILP…”
Získať plný text
Journal Article -
11
A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems
ISSN: 0377-2217, 1872-6860Vydavateľské údaje: Elsevier B.V 16.08.2017Vydané v European journal of operational research (16.08.2017)“… In this paper we use a Dantzig–Wolfe reformulation to decompose…”
Získať plný text
Journal Article -
12
Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover
ISSN: 0305-0548, 0305-0548Vydavateľské údaje: New York Elsevier Ltd 01.08.2021Vydané v Computers & operations research (01.08.2021)“…•A Dantzig-Wolfe formulation by machine decomposition is constructed.•A set-oriented data-driven branching and selection algorithm is proposed…”
Získať plný text
Journal Article -
13
A branch-price-and-cut algorithm for multi-mode resource leveling
ISSN: 0377-2217, 1872-6860Vydavateľské údaje: Amsterdam Elsevier B.V 16.08.2015Vydané v European journal of operational research (16.08.2015)“…•We present a new model and algorithm for a RCPSP with availability constraints.•We propose a non-trivial, non-obvious Dantzig–Wolfe reformulation…”
Získať plný text
Journal Article -
14
Solution algorithms for dock scheduling and truck sequencing in cross-docks: A neural branch-and-price and a metaheuristic
ISSN: 0305-0548, 1873-765XVydavateľské údaje: Elsevier Ltd 01.07.2024Vydané v Computers & operations research (01.07.2024)“… Many existing models for variations of this problem in the literature rely on big-M constraints, known for their poor performance when applied to general-purpose mixed-integer programming solvers…”
Získať plný text
Journal Article -
15
Scalable branching on dual decomposition of stochastic mixed-integer programming problems
ISSN: 1867-2949, 1867-2957Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2022Vydané v Mathematical programming computation (01.03.2022)“…We present a scalable branching method for the dual decomposition of stochastic mixed-integer programming…”
Získať plný text
Journal Article -
16
Simultaneously exploiting two formulations: An exact benders decomposition approach
ISSN: 0305-0548, 0305-0548Vydavateľské údaje: New York Elsevier Ltd 01.11.2020Vydané v Computers & operations research (01.11.2020)“… When modelling a given problem using integer linear programming techniques several possibilities often exist, each resulting in a different mathematical formulation of the problem…”
Získať plný text
Journal Article -
17
Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
ISSN: 0925-5001, 1573-2916Vydavateľské údaje: New York Springer US 01.12.2021Vydané v Journal of global optimization (01.12.2021)“… due to decomposable structure. Integrality of the linking variables allows us to apply a discretization approach to derive a Dantzig-Wolfe reformulation and solve the problem to global optimality using branch-andprice…”
Získať plný text
Journal Article -
18
A New Dantzig-Wolfe Reformulation And Branch-And-Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times
Vydavateľské údaje: St. Louis Federal Reserve Bank of St. Louis 01.01.2003Vydané v IDEAS Working Paper Series from RePEc (01.01.2003)“…The textbook Dantzig-Wolfe decomposition for the Capacitated Lot Sizing Problem (CLSP),as already proposed by Manne in 1958, has an important structural deficiency…”
Získať plný text
Paper -
19
The green capacitated multi-item lot sizing problem with parallel machines
ISSN: 0305-0548, 1873-765X, 0305-0548Vydavateľské údaje: New York Elsevier Ltd 01.10.2018Vydané v Computers & operations research (01.10.2018)“…•We propose a mixed integer programming model for the green capacitated multi-item lot sizing problem with parallel machines…”
Získať plný text
Journal Article -
20
Column generation for multistage stochastic mixed-integer nonlinear programs with discrete state variables
ISSN: 0925-5001, 1573-2916Vydavateľské údaje: 25.03.2025Vydané v Journal of global optimization (25.03.2025)Získať plný text
Journal Article