Suchergebnisse - Mathematical optimization. Approximation theory. Integer programming. Linear programming.

  1. 1

    Robust Optimization von Ben-Tal, Aharon, El Ghaoui, Laurent, Nemirovski, Arkadi

    ISBN: 9780691143682, 0691143684, 9781400831050, 1400831059
    Veröffentlicht: Princeton, N.J Princeton University Press 2009
    “… Robust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle …”
    Volltext
    E-Book Buch
  2. 2

    An exponential cone integer programming and piece-wise linear approximation approach for 0-1 fractional programming von Pham, Hoang Giang, Ta, Thuy Anh, Mai, Tien

    ISSN: 1382-6905, 1573-2886
    Veröffentlicht: New York Springer US 01.07.2025
    Veröffentlicht in Journal of combinatorial optimization (01.07.2025)
    “… These problems are known to be NP-hard to approximate within any constant factor, and existing solution approaches typically rely on mixed-integer linear programming or second-order cone programming reformulations …”
    Volltext
    Journal Article
  3. 3

    The integer approximation error in mixed-integer optimal control von Sager, Sebastian, Bock, Hans Georg, Diehl, Moritz

    ISSN: 0025-5610, 1436-4646
    Veröffentlicht: Berlin/Heidelberg Springer-Verlag 01.06.2012
    Veröffentlicht in Mathematical programming (01.06.2012)
    “… We extend recent work on nonlinear optimal control problems with integer restrictions on some of the control functions …”
    Volltext
    Journal Article
  4. 4

    Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach von Luathep, Paramet, Sumalee, Agachai, Lam, William H.K., Li, Zhi-Chun, Lo, Hong K.

    ISSN: 0191-2615, 1879-2367
    Veröffentlicht: Kidlington Elsevier Ltd 01.06.2011
    Veröffentlicht in Transportation research. Part B: methodological (01.06.2011)
    “… ► Mixed network design problem (MNDP) can be formulated as a mixed-integer linear programming problem (MILP …”
    Volltext
    Journal Article
  5. 5

    Piecewise linear approximation with minimum number of linear segments and minimum error: A fast approach to tighten and warm start the hierarchical mixed integer formulation von Ploussard, Quentin

    ISSN: 0377-2217
    Veröffentlicht: United States Elsevier B.V 16.05.2024
    Veröffentlicht in European journal of operational research (16.05.2024)
    “… ) functions are a convenient way to achieve this. PWL functions can be modeled in mathematical problems using only linear and integer variables …”
    Volltext
    Journal Article
  6. 6

    A Robust Optimization Approach to Inventory Theory von Bertsimas, Dimitris, Thiele, Aurelie

    ISSN: 0030-364X, 1526-5463
    Veröffentlicht: Linthicum, MD INFORMS 01.01.2006
    Veröffentlicht in Operations research (01.01.2006)
    “… We propose a general methodology based on robust optimization to address the problem of optimally controlling a supply chain subject to stochastic demand in discrete time …”
    Volltext
    Journal Article
  7. 7

    An outer approximation algorithm for generating the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems von Bökler, Fritz, Parragh, Sophie N, Sinnl, Markus, Tricoire, Fabien

    ISSN: 1432-5217, 1432-2994, 1432-5217
    Veröffentlicht: Berlin, Heidelberg Springer 01.08.2024
    “… –Pareto hull of multi-objective mixed-integer linear programming problems (MOMILPs). It produces the extreme points (i.e., the vertices …”
    Volltext
    Journal Article
  8. 8

    On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations von Bärmann, Andreas, Burlacu, Robert, Hager, Lukas, Kleinert, Thomas

    ISSN: 1573-2916, 0925-5001, 1573-2916
    Veröffentlicht: New York, NY Springer US 01.04.2023
    Veröffentlicht in Journal of global optimization (01.04.2023)
    “… One approach to tackle this difficulty is to use bivariate piecewise linear approximations for each variable product, which can be represented via mixed-integer linear programming (MIP) formulations …”
    Volltext
    Journal Article
  9. 9

    Alternative regularizations for Outer-Approximation algorithms for convex MINLP von Bernal, David E., Peng, Zedong, Kronqvist, Jan, Grossmann, Ignacio E.

    ISSN: 0925-5001, 1573-2916, 1573-2916
    Veröffentlicht: Ames Research Center Springer 01.12.2022
    Veröffentlicht in Journal of global optimization (01.12.2022)
    “… functions and develop a regularized single-tree search method for solving convex mixed-integer nonlinear programming (MINLP) problems …”
    Volltext
    Journal Article
  10. 10

    The Traveling Salesman Problem: A Computational Study von Applegate, David L, Bixby, Robert E, Chvátal, Vašek, Cook, William J

    ISBN: 9780691129938, 0691129932, 1400841100, 9781400841103
    Veröffentlicht: Princeton Princeton University Press 2011
    “… This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It …”
    Volltext
    E-Book Buch
  11. 11

    Topology optimization via sequential integer programming and Canonical relaxation algorithm von Liang, Yuan, Cheng, Gengdong

    ISSN: 0045-7825, 1879-2138
    Veröffentlicht: Amsterdam Elsevier B.V 01.05.2019
    “… The mathematical essence of structural topology optimization is large-scale nonlinear integer programming …”
    Volltext
    Journal Article
  12. 12

    Partially distributed outer approximation von Murray, Alexander, Faulwasser, Timm, Hagenmeyer, Veit, Villanueva, Mario E, Houska, Boris

    ISSN: 1573-2916, 0925-5001, 1573-2916
    Veröffentlicht: New York, NY Springer US 01.07.2021
    Veröffentlicht in Journal of global optimization (01.07.2021)
    “… This paper presents a novel partially distributed outer approximation algorithm, named PaDOA, for solving a class of structured mixed integer convex programming problems to global optimality …”
    Volltext
    Journal Article
  13. 13

    Empirical decision model learning von Lombardi, Michele, Milano, Michela, Bartolini, Andrea

    ISSN: 0004-3702, 1872-7921
    Veröffentlicht: Amsterdam Elsevier B.V 01.03.2017
    Veröffentlicht in Artificial intelligence (01.03.2017)
    “… One of the biggest challenges in the design of real-world decision support systems is coming up with a good combinatorial optimization model …”
    Volltext
    Journal Article
  14. 14

    Global optimization of bilinear programs with a multiparametric disaggregation technique von Kolodziej, Scott, Castro, Pedro M., Grossmann, Ignacio E.

    ISSN: 0925-5001, 1573-2916
    Veröffentlicht: Boston Springer US 01.12.2013
    Veröffentlicht in Journal of global optimization (01.12.2013)
    “… ) for solving nonconvex bilinear programs. Both upper and lower bounding formulations corresponding to mixed-integer linear programs are derived using disjunctive programming and exact linearizations, and incorporated into two global …”
    Volltext
    Journal Article
  15. 15

    Multiobjective Mixed-Integer Quadratic Models: A Study on Mathematical Programming and Evolutionary Computation von Shir, Ofer M., Emmerich, Michael

    ISSN: 1089-778X, 1941-0026
    Veröffentlicht: IEEE 01.06.2025
    Veröffentlicht in IEEE transactions on evolutionary computation (01.06.2025)
    “… To do so, this article compares a mathematical programming approach with an evolutionary method for set-oriented Pareto front approximation of bi-objective quadratic MI optimization …”
    Volltext
    Journal Article
  16. 16

    Perspective reformulations of mixed integer nonlinear programs with indicator variables von Günlük, Oktay, Linderoth, Jeff

    ISSN: 0025-5610, 1436-4646
    Veröffentlicht: Berlin/Heidelberg Springer-Verlag 01.07.2010
    Veröffentlicht in Mathematical programming (01.07.2010)
    “… We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision variables …”
    Volltext
    Journal Article Tagungsbericht
  17. 17

    Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones von Bernal Neira, David E., Grossmann, Ignacio E.

    ISSN: 0926-6003, 1573-2894
    Veröffentlicht: New York Springer US 01.05.2024
    Veröffentlicht in Computational optimization and applications (01.05.2024)
    “… We then show the reformulation of conic GDPs into Mixed-Integer Conic Programming (MICP) problems through both the big-M and hull reformulations …”
    Volltext
    Journal Article
  18. 18

    On mixed-integer optimal control with constrained total variation of the integer control von Sager, Sebastian, Zeile, Clemens

    ISSN: 1573-2894, 0926-6003, 1573-2894
    Veröffentlicht: New York, NY Springer US 01.03.2021
    Veröffentlicht in Computational optimization and applications (01.03.2021)
    “… The combinatorial integral approximation (CIA) decomposition suggests solving mixed-integer optimal control problems by solving one continuous nonlinear control problem and one mixed-integer linear program (MILP …”
    Volltext
    Journal Article
  19. 19

    Optimization Model for Backup Resource Allocation in Middleboxes With Importance von He, Fujun, Sato, Takehiro, Oki, Eiji

    ISSN: 1063-6692, 1558-2566
    Veröffentlicht: New York IEEE 01.08.2019
    Veröffentlicht in IEEE/ACM transactions on networking (01.08.2019)
    “… We formulate the proposed backup resource allocation model as a mixed integer linear programming problem …”
    Volltext
    Journal Article
  20. 20

    Weapon-target assignment problem: exact and approximate solution algorithms von Andersen, Alexandre Colaers, Pavlikov, Konstantin, Toffolo, Túlio A. M.

    ISSN: 0254-5330, 1572-9338
    Veröffentlicht: New York Springer US 01.05.2022
    Veröffentlicht in Annals of operations research (01.05.2022)
    “… ), such that the expected value of survived targets is minimized. The WTA problem is a nonlinear combinatorial optimization problem known to be NP-hard …”
    Volltext
    Journal Article