default search action
Matthias Walter
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j21]Alberto Del Pia
, Matthias Walter
Simple odd β-cycle inequalities for binary polynomial optimization. Math. Program. 206(1): 203-238 (2024) - [c18]Emily Schutte, Matthias Walter
Relaxation Strength for Multilinear Optimization: McCormick Strikes Back. IPCO 2024: 393-404 - [i21]Rolf van der Hulst, Matthias Walter:
A Row-wise Algorithm for Graph Realization. CoRR abs/2408.12869 (2024) - 2023
- [j20]Matthias Walter
Recognizing Series-Parallel Matrices in Linear Time. INFORMS J. Comput. 35(6): 1404-1418 (2023) - [i20]Matthias Walter:
The Binary Linearization Complexity of Pseudo-Boolean Functions. CoRR abs/2301.06207 (2023) - [i19]Rong Zou, Boyue Lin, Marc Uetz, Matthias Walter:
Algorithmic Solutions for Maximizing Shareable Costs. CoRR abs/2303.00052 (2023) - [i18]Emily Schutte, Matthias Walter:
Relaxation strength for multilinear optimization: McCormick strikes back. CoRR abs/2311.08570 (2023) - 2022
- [j19]Marije Siemann, Matthias Walter
A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem. Discret. Optim. 46: 100741 (2022) - [j18]Elisabeth Rodríguez-Heck, Karl Stickler, Matthias Walter
Persistency of linear programming relaxations for the stable set problem. Math. Program. 192(1): 387-407 (2022) - [c17]Alberto Del Pia
Simple Odd β-Cycle Inequalities for Binary Polynomial Optimization. IPCO 2022: 181-194 - [c16]Joran van den Bosse, Marc Uetz, Matthias Walter:
Exact Price of Anarchy for Weighted Congestion Games with Two Players. ISCO 2022: 159-171 - [i17]Joran van den Bosse, Marc Uetz, Matthias Walter:
Exact Price of Anarchy for Weighted Congestion Games with Two Players. CoRR abs/2203.01740 (2022) - 2021
- [j17]Matthias Walter
The Graphical Traveling Salesperson Problem has no integer programming formulation in the original space. Oper. Res. Lett. 49(4): 623-624 (2021) - [c15]Matthias Walter:
Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs. IPCO 2021: 399-412 - [i16]Matthias Walter:
The Graphical Traveling Salesperson Problem has no Integer Programming Formulation in the Original Space. CoRR abs/2106.10097 (2021) - [i15]Alberto Del Pia, Matthias Walter:
Simple odd $β$-cycle inequalities for binary polynomial optimization. CoRR abs/2111.04858 (2021) - [i14]Matthias Walter:
Recognizing Series-Parallel Matrices in Linear Time. CoRR abs/2111.07628 (2021) - 2020
- [j16]Wolfram H. Wellssow, Philipp Hinkel, Marian Zugck, C. Dumas, Sebastian Hilgers, Matthias Livrozet, Andreas Mannebach, Matthias Walter, Christian Picken, Christoph Schneiders, Michael Görgen, Christian Waniek:
Advantages of digitalization in grid restoration. Autom. 68(9): 790-803 (2020) - [j15]Dominik Ermel, Matthias Walter
Parity polytopes and binarization. Discret. Appl. Math. 272: 24-30 (2020) - [j14]Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge
Correction to: Extended Formulations for Independence Polytopes of Regular Matroids. Graphs Comb. 36(1): 177-179 (2020) - [c14]Maximilian Metzner, Daniel Utsch, Matthias Walter, Christian Hofstetter, Christina Ramer, Andreas Blank
A system for human-in-the-loop simulation of industrial collaborative robot applications*. CASE 2020: 1520-1525 - [c13]Elisabeth Rodríguez-Heck, Karl Stickler, Matthias Walter, Stefan Weltge
Persistency of Linear Programming Relaxations for the Stable Set Problem. IPCO 2020: 351-363 - [i13]Matthias Walter:
Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs. CoRR abs/2011.06076 (2020) - [i12]Marije Siemann, Matthias Walter:
A Polyhedral Study for the Cubic Formulation of the Unconstrained Traveling Tournament Problem. CoRR abs/2011.09135 (2020)
2010 – 2019
- 2019
- [j13]Matthias Walter
Reliability of supraspinal correlates to lower urinary tract stimulation in healthy participants - A fMRI study. NeuroImage 191: 481-492 (2019) - [j12]Matthias Walter
Extended formulations for radial cones. Oper. Res. Lett. 47(5): 458-463 (2019) - [j11]Matthias Walter
Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs. SIAM J. Discret. Math. 33(2): 1061-1094 (2019) - [c12]Matthias Walter, Volodymyr Vasyutynskyy, Duc Anh Trinh, Christian Leyh:
Machine Learning goes Measure Management: Leveraging Anomaly Detection and Parts Search to Improve Product-Cost Optimization. Wirtschaftsinformatik 2019: 529-534 - [i11]Annika Thome, Matthias Walter:
The Almost-Disjoint 2-Path Decomposition Problem. CoRR abs/1907.04906 (2019) - [i10]Elisabeth Rodríguez-Heck, Karl Stickler, Matthias Walter, Stefan Weltge:
Persistency of Linear Programming Formulations for the Stable Set Problem. CoRR abs/1911.01478 (2019) - [i9]Christopher Hojny, Marc E. Pfetsch, Matthias Walter:
Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials. CoRR abs/1911.06894 (2019) - 2018
- [c11]Matthias Walter:
Approach to IS Solution Design and Instantiation for Practice-Oriented Research - A Design Science Research Perspective. AITM/ISM@FedCSIS 2018: 194-213 - [c10]Matthias Walter:
An Approach to Transforming Requirements into Evaluable UI Design for Contextual Practice - A Design Science Research Perspective. FedCSIS 2018: 715-724 - [c9]Simon Voelker, Matthias Walter, Torsten Munkelt:
Improving Product Life-Cycle Cost Management by the Application of Recommender Systems. MKWI 2018: 2019-2030 - [c8]Matthias Walter, Christian Leyh, Susanne Strahringer:
Toward Early Product Cost Optimization: Requirements for an Integrated Measure Management Approach. MKWI 2018: 2057-2068 - [i8]Dominik Ermel, Matthias Walter:
Parity Polytopes and Binarization. CoRR abs/1803.10561 (2018) - [i7]Matthias Walter, Stefan Weltge:
Extended Formulations for Radial Cones. CoRR abs/1805.10325 (2018) - 2017
- [j10]Matthias Walter, Christian Leyh, Susanne Strahringer
Knocking on Industry's Door: Needs in Product-Cost Optimization in the Early Product Life Cycle Stages. Complex Syst. Informatics Model. Q. 13: 43-60 (2017) - [c7]Matthias Walter, Christian Leyh:
Knocking on Industry's Door: Product Cost Optimization in the Early Stages Requires Better Software Support. CBI (1) 2017: 330-338 - [i6]Volker Kaibel, Matthias Walter
A Note on Matchings Constructed during Edmonds' Weighted Perfect Matching Algorithm. CoRR abs/1703.09505 (2017) - 2016
- [j9]Matthias Walter
Minimizing average project team size given multi-skilled workers with heterogeneous skill levels. Comput. Oper. Res. 70: 163-179 (2016) - [j8]Volker Kaibel, Jon Lee, Matthias Walter
Extended Formulations for Independence Polytopes of Regular Matroids. Graphs Comb. 32(5): 1931-1944 (2016) - [j7]Maximilian Röglinger, Manuel Bolsinger, Björn Häckel, Matthias Walter:
How to Structure Business Transformation Projects: The Case of Infineon's Finance IT Roadmap. J. Inf. Technol. Theory Appl. 17(2): 2 (2016) - [j6]Matthias Walter
On a cardinality-constrained transportation problem with market choice. Oper. Res. Lett. 44(2): 170-173 (2016) - [i5]Matthias Walter:
Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs. CoRR abs/1607.01880 (2016) - 2015
- [j5]Volker Kaibel, Matthias Walter
Simple extensions of polytopes. Math. Program. 154(1-2): 381-406 (2015) - [j4]Michele Conforti, Volker Kaibel, Matthias Walter
Subgraph polytopes and independence polytopes of count matroids. Oper. Res. Lett. 43(5): 457-460 (2015) - [i4]Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge:
Subgraph Polytopes and Independence Polytopes of Count Matroids. CoRR abs/1502.02817 (2015) - [i3]Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge:
Extended Formulations for Independence Polytopes of Regular Matroids. CoRR abs/1504.03872 (2015) - 2014
- [c6]Volker Kaibel, Matthias Walter
Simple Extensions of Polytopes. IPCO 2014: 309-320 - 2013
- [j3]Matthias Walter
Implementation of a unimodularity test. Math. Program. Comput. 5(1): 57-73 (2013) - [c5]Lars Krüger, Matthias Walter, Peter Heydebreck:
Future performance classification of high-technology venture investments with limited data. FUZZ-IEEE 2013: 1-8 - [c4]Lars Krüger, Matthias Walter, Jayesh Jani:
Bio-inspired optimization of an incrementally updated fuzzy investment decision support system. FUZZ-IEEE 2013: 1-8 - [c3]Lars Krüger, Matthias Walter:
A Particle-Swarm-Optimized Fuzzy Classifier Used for Investment Decision Support. IWANN (1) 2013: 253-261 - [i2]Volker Kaibel, Matthias Walter:
Simple Extensions of Polytopes. CoRR abs/1311.3470 (2013) - 2012
- [j2]Patrick Brugger, Emil Wagner, Maximilian Röglinger, Matthias Walter, Julia Wiesent:
Prozesskonfiguration mit ökonomischem Augenmaß - Ein Erfahrungsbericht aus der Bierbranche. Wirtschaftsinformatik Manag. 4(3): 60-65 (2012) - [c2]Matthias Walter
Sparsity of Lift-and-Project Cutting Planes. OR 2012: 9-14 - [i1]Matthias Walter, Klaus Truemper:
Implementation of a Unimodularity Test. CoRR abs/1202.4061 (2012) - 2011
- [c1]Matthias Walter, Jürgen Zimmermann:
On a multi-project staffing problem with heterogeneously skilled workers. OR 2011: 489-494 - 2010
- [j1]Matthias Walter
A heuristic approach to project staffing. Electron. Notes Discret. Math. 36: 775-782 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 00:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: