„Mixed integer linear programming“

Suchergebnisse

244 Treffer

• A Bilevel Mixed Integer Linear Programming Model for Valves Location in Water Distribution Systems
  Peano, Andrea ; Nonato, Maddalena ; Gavanelli, Marco ; Alvisi, Stefano ; Franchini, Marco 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Safe bounds in linear and mixed-integer linear programming
  Neumaier, Arnold ; Shcherbina, Oleg
• Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I
  Beach, Benjamin ; Burlacu, Robert ; Bärmann, Andreas ; Hager, Lukas ; Hildebrand, Robert 2024 Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
• Implementation of Presolving and Interior-Point Algorithm for Linear & Mixed Integer Programming: SOFTWARE
  Ndayikengurutse, Adrien ; Huang, Siming
• An Adaptive Refinement Algorithm for Discretizations of Nonconvex QCQP
  Gupte, Akshay ; Koster, Arie M.C.A. ; Kuhnke, Sascha 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Algorithm-Independent Measure of Progress for Linear Constraint Propagation
  Sofranac, Boro ; Gleixner, Ambros ; Pokutta, Sebastian 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parsimonious Clone Tree Reconciliation in Cancer
  Sashittal, Palash ; Zaccaria, Simone ; El-Kebir, Mohammed 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand
  Peng, Bo ; Fisher, Nathan ; Chantem, Thidapat 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Time-Dependent Tourist Tour Planning with Adjustable Profits
  Gündling, Felix ; Witzel, Tim 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Path&Cycle Formulation for the Hotspot Problem in Air Traffic Management
  Mannino, Carlo ; Sartor, Giorgio 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Bilevel Approach to Frequency Optimization in Public Transportation Systems
  Arizti, Agustin ; Mauttone, Antonio ; Urquhart, Maria E. 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Theory and Practice of SAT and Combinatorial Solving (Dagstuhl Seminar 22411)
  Beyersdorff, Olaf ; Biere, Armin ; Ganesh, Vijay ; Nordström, Jakob ; Oertel, Andy
• Towards the Integration of Power-Indexed Formulations in Multi-Architecture Connected Facility Location Problems for the Optimal Design of Hybrid Fiber-Wireless Access Networks
  D’Andreagiovanni, Fabio ; Mett, Fabian ; Pulaj, Jonad 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Real Time Railway Traffic Management Modeling Track-Circuits
  Pellegrini, Paola ; Marlière, Grégory ; Rodriguez, Joaquin 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• MILP formulations of cumulative constraints for railway scheduling - A comparative study
  Aronsson, Martin ; Bohlin, Markus ; Kreuger, Per 2009 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Multi-Agents System for Solving Facility Layout Problem: Application to Operating Theater
  Chraibi, Abdelahad ; Kharraja, Said ; Osman, Ibrahim H. ; Elbeqqali, Omar
• Linear and Mixed Integer Programming for Portfolio Optimization
  Mansini, Renata ; Ogryczak, Włodzimierz ; Speranza, Grazia 2015 Springer International Publishing
• Sorting Last-In-First-Out Stacks
  Wilschewski, Fabian 2024 BoD – Books on Demand
• Stellplatzoptimierung im Einplatzregal – Planung effizienter Regale für Behälter unterschiedlicher Höhen
  Rief, Jona ; Fottner, Johannes
• Green optimization of agro-food supply chains: integrating straw returning and deep tillage into a mixed integer linear programming model
  Fang, Ying ; Li, Jing ; Chen, Jiyuan