Search Results - Mixed integer programming Dantzig-Wolfe decomposition Reformulation

Refine Results
  1. 1

    Classification of DantzigWolfe reformulations for binary mixed integer programming problems by Jans, Raf

    ISSN: 0377-2217, 1872-6860
    Published: Amsterdam Elsevier B.V 16.07.2010
    Published in European journal of operational research (16.07.2010)
    “…In this note, we provide a classification of DantzigWolfe reformulations for Binary Mixed Integer Programming Problems…”
    Get full text
    Journal Article
  2. 2

    A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times by Degraeve, Zeger, Jans, Raf

    ISSN: 0030-364X, 1526-5463
    Published: Linthicum, MD INFORMS 01.09.2007
    Published in 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…”
    Get full text
    Journal Article
  3. 3

    Automatic DantzigWolfe reformulation of mixed integer programs by Bergner, Martin, Caprara, Alberto, Ceselli, Alberto, Furini, Fabio, Lübbecke, Marco E., Malaguti, Enrico, Traversi, Emiliano

    ISSN: 0025-5610, 1436-4646
    Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2015
    Published in Mathematical programming (01.02.2015)
    “…DantzigWolfe decomposition (or reformulation) is well-known to provide strong dual bounds for specially structured mixed integer programs (MIPs…”
    Get full text
    Journal Article
  4. 4

    Solving the Temporal Knapsack Problem via Recursive DantzigWolfe Reformulation by Caprara, Alberto, Furini, Fabio, Malaguti, Enrico, Traversi, Emiliano

    ISSN: 0020-0190, 1872-6119
    Published: Amsterdam Elsevier B.V 01.05.2016
    Published in Information processing letters (01.05.2016)
    “… only. In this paper we solve the TKP using what we call a Recursive DantzigWolfe Reformulation (DWR) method…”
    Get full text
    Journal Article
  5. 5

    DantzigWolfe reformulations for binary quadratic problems by Ceselli, Alberto, Létocart, Lucas, Traversi, Emiliano

    ISSN: 1867-2949, 1867-2957
    Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2022
    Published in Mathematical programming computation (01.03.2022)
    “… We propose a first methodological analysis on a family of reformulations combining Dantzig…”
    Get full text
    Journal Article
  6. 6

    A data driven DantzigWolfe decomposition framework by Basso, Saverio, Ceselli, Alberto

    ISSN: 1867-2949, 1867-2957
    Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2023
    Published in Mathematical programming computation (01.03.2023)
    “… algebraic structure of the MIP instance. We propose to employ DantzigWolfe reformulation and machine learning methods to obtain a fully data driven automatic decomposition framework…”
    Get full text
    Journal Article
  7. 7

    Dantzig-Wolfe decomposition for the facility location and production planning problem by Wu, Tao, Shi, Zhongshun, Liang, Zhe, Zhang, Xiaoning, Zhang, Canrong

    ISSN: 0305-0548, 0305-0548
    Published: New York Elsevier Ltd 01.12.2020
    Published in Computers & operations research (01.12.2020)
    “…•We analyze the relationship between these models and Dantzig-Wolfe decomposition reformulations…”
    Get full text
    Journal Article
  8. 8

    Price-and-verify: a new algorithm for recursive circle packing using DantzigWolfe decomposition by Gleixner, Ambros, Maher, Stephen J., Müller, Benjamin, Pedroso, João Pedro

    ISSN: 0254-5330, 1572-9338
    Published: New York Springer US 01.01.2020
    Published in 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…”
    Get full text
    Journal Article
  9. 9

    A generic view of DantzigWolfe decomposition in mixed integer programming by Vanderbeck, François, Savelsbergh, Martin W.P.

    ISSN: 0167-6377, 1872-7468
    Published: Amsterdam Elsevier B.V 2006
    Published in Operations research letters (2006)
    “…The DantzigWolfe reformulation principle is presented based on the concept of generating sets…”
    Get full text
    Journal Article
  10. 10

    A near-optimal solution method for coordinated operation planning problem of power- and heat-interchange networks using column generation-based decomposition by Wakui, Tetsuya, Hashiguchi, Moe, Yokoyama, Ryohei

    ISSN: 0360-5442, 1873-6785
    Published: Oxford Elsevier Ltd 15.04.2020
    Published in Energy (15.04.2020)
    “… efficiency and scalability. The coordinated operation-planning problem, based on a mixed-integer linear programming (MILP…”
    Get full text
    Journal Article
  11. 11

    A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems by Schulze, Tim, Grothey, Andreas, McKinnon, Ken

    ISSN: 0377-2217, 1872-6860
    Published: Elsevier B.V 16.08.2017
    Published in European journal of operational research (16.08.2017)
    “… In this paper we use a DantzigWolfe reformulation to decompose…”
    Get full text
    Journal Article
  12. 12

    Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover by Zhang, Canrong, Zhang, Dandan, Wu, Tao

    ISSN: 0305-0548, 0305-0548
    Published: New York Elsevier Ltd 01.08.2021
    Published in 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…”
    Get full text
    Journal Article
  13. 13

    A branch-price-and-cut algorithm for multi-mode resource leveling by Coughlan, Eamonn T., Lübbecke, Marco E., Schulz, Jens

    ISSN: 0377-2217, 1872-6860
    Published: Amsterdam Elsevier B.V 16.08.2015
    Published in 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 DantzigWolfe reformulation…”
    Get full text
    Journal Article
  14. 14

    Solution algorithms for dock scheduling and truck sequencing in cross-docks: A neural branch-and-price and a metaheuristic by Monemi, Rahimeh Neamatian, Gelareh, Shahin, Maculan, Nelson

    ISSN: 0305-0548, 1873-765X
    Published: Elsevier Ltd 01.07.2024
    Published in 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…”
    Get full text
    Journal Article
  15. 15

    Scalable branching on dual decomposition of stochastic mixed-integer programming problems by Kim, Kibaek, Dandurand, Brian

    ISSN: 1867-2949, 1867-2957
    Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2022
    Published in Mathematical programming computation (01.03.2022)
    “…We present a scalable branching method for the dual decomposition of stochastic mixed-integer programming…”
    Get full text
    Journal Article
  16. 16

    Simultaneously exploiting two formulations: An exact benders decomposition approach by Lusby, Richard Martin, Gamst, Mette, Ropke, Stefan, Spoorendonk, Simon

    ISSN: 0305-0548, 0305-0548
    Published: New York Elsevier Ltd 01.11.2020
    Published in 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…”
    Get full text
    Journal Article
  17. 17

    Branch-and-price for a class of nonconvex mixed-integer nonlinear programs by Allman, Andrew, Zhang, Qi

    ISSN: 0925-5001, 1573-2916
    Published: New York Springer US 01.12.2021
    Published in 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…”
    Get full text
    Journal Article
  18. 18

    A New Dantzig-Wolfe Reformulation And Branch-And-Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times by Degraeve, Z, Jans, R F

    Published: St. Louis Federal Reserve Bank of St. Louis 01.01.2003
    Published in 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…”
    Get full text
    Paper
  19. 19

    The green capacitated multi-item lot sizing problem with parallel machines by Wu, Tao, Xiao, Fan, Zhang, Canrong, He, Yan, Liang, Zhe

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Published: New York Elsevier Ltd 01.10.2018
    Published in 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…”
    Get full text
    Journal Article
  20. 20