Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles (Englisch)
- Neue Suche nach: Kobayashi, Yusuke
- Weitere Informationen zu Kobayashi, Yusuke:
- https://orcid.org/http://orcid.org/0000-0001-9478-7307
- Neue Suche nach: Bienstock, Daniel
- Neue Suche nach: Zambelli, Giacomo
- Neue Suche nach: Kobayashi, Yusuke
- Weitere Informationen zu Kobayashi, Yusuke:
- https://orcid.org/http://orcid.org/0000-0001-9478-7307
In:
Integer Programming and Combinatorial Optimization
: 21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings
;
Kapitel: 22
;
280-293
;
2020
- Aufsatz/Kapitel (Buch) / Elektronische Ressource
-
Titel:Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles
-
Weitere Titelangaben:Lect.Notes Computer
-
Beteiligte:Bienstock, Daniel ( Herausgeber:in ) / Zambelli, Giacomo ( Herausgeber:in ) / Kobayashi, Yusuke ( Autor:in )
-
Kongress:International Conference on Integer Programming and Combinatorial Optimization ; 2020 ; London, United Kingdom
-
Erschienen in:Integer Programming and Combinatorial Optimization : 21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings ; Kapitel: 22 ; 280-293Lecture Notes in Computer Science ; 12125 ; 280-293
-
Verlag:
- Neue Suche nach: Springer International Publishing
-
Erscheinungsort:Cham
-
Erscheinungsdatum:14.04.2020
-
Format / Umfang:14 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz/Kapitel (Buch)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
Inhaltsverzeichnis E-Book
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Idealness of k-wise Intersecting FamiliesAbdi, Ahmad / Cornuéjols, Gérard / Huynh, Tony / Lee, Dabeen et al. | 2020
- 2
-
Flexible Graph ConnectivityAdjiashvili, David / Hommelsheim, Felix / Mühlenthaler, Moritz et al. | 2020
- 3
-
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum CutsAissi, Hassene / McCormick, S. Thomas / Queyranne, Maurice et al. | 2020
- 4
-
Optimizing Sparsity over Lattices and SemigroupsAliev, Iskander / Averkov, Gennadiy / De Loera, Jesús A. / Oertel, Timm et al. | 2020
- 5
-
A Technique for Obtaining True Approximations for k-Center with Covering ConstraintsAnegg, Georg / Angelidakis, Haris / Kurpisz, Adam / Zenklusen, Rico et al. | 2020
- 6
-
Tight Approximation Bounds for Maximum Multi-coverageBarman, Siddharth / Fawzi, Omar / Ghoshal, Suprovat / Gürpınar, Emirhan et al. | 2020
- 7
-
Implementing Automatic Benders Decomposition in a Modern MIP SolverBonami, Pierre / Salvagnin, Domenico / Tramontani, Andrea et al. | 2020
- 8
-
Improved Approximation Algorithms for Inventory ProblemsBosman, Thomas / Olver, Neil et al. | 2020
- 9
-
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd CyclesConforti, Michele / Fiorini, Samuel / Huynh, Tony / Weltge, Stefan et al. | 2020
- 10
-
On a Generalization of the Chvátal-Gomory ClosureDash, Sanjeeb / Günlük, Oktay / Lee, Dabeen et al. | 2020
- 11
-
Algorithms for Flows over Time with Scheduling CostsFrascaria, Dario / Olver, Neil et al. | 2020
- 12
-
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-ApproximationGarg, Naveen / Kumar, Nikhil / Sebő, András et al. | 2020
- 13
-
Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract)Gupta, Anupam / Kumar, Amit / Nagarajan, Viswanath / Shen, Xiangkun et al. | 2020
- 14
-
Continuous Facility Location on GraphsHartmann, Tim A. / Lendl, Stefan / Woeginger, Gerhard J. et al. | 2020
- 15
-
Recognizing Even-Cycle and Even-Cut MatroidsHeo, Cheolwon / Guenin, Bertrand et al. | 2020
- 16
-
A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\times $$\end{document} 2 SubmatricesHirai, Hiroshi / Iwamasa, Yuni et al. | 2020
- 17
-
Fair Colorful k-Center ClusteringJia, Xinrui / Sheth, Kshiteej / Svensson, Ola et al. | 2020
- 18
-
Popular Branchings and Their Dual CertificatesKavitha, Telikepalli / Király, Tamás / Matuschke, Jannik / Schlotter, Ildikó / Schmidt-Kraepelin, Ulrike et al. | 2020
- 19
-
Sparse Graphs and an Augmentation ProblemKirály, Csaba / Mihálykó, András et al. | 2020
- 20
-
About the Complexity of Two-Stage Stochastic IPsKlein, Kim-Manuel et al. | 2020
- 21
-
Packing Under Convex Quadratic ConstraintsKlimm, Max / Pfetsch, Marc E. / Raber, Rico / Skutella, Martin et al. | 2020
- 22
-
Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden TrianglesKobayashi, Yusuke et al. | 2020
- 23
-
Single Source Unsplittable Flows with Arc-Wise Lower and Upper BoundsMorell, Sarah / Skutella, Martin et al. | 2020
- 24
-
Maximal Quadratic-Free SetsMuñoz, Gonzalo / Serrano, Felipe et al. | 2020
- 25
-
On Generalized Surrogate Duality in Mixed-Integer Nonlinear ProgrammingMüller, Benjamin / Muñoz, Gonzalo / Gasse, Maxime / Gleixner, Ambros / Lodi, Andrea / Serrano, Felipe et al. | 2020
- 26
-
The Integrality Number of an Integer ProgramPaat, Joseph / Schlöter, Miriam / Weismantel, Robert et al. | 2020
- 27
-
Persistency of Linear Programming Relaxations for the Stable Set ProblemRodríguez-Heck, Elisabeth / Stickler, Karl / Walter, Matthias / Weltge, Stefan et al. | 2020
- 28
-
Constructing Lattice-Free Gradient Polyhedra in Dimension TwoPaat, Joseph / Schlöter, Miriam / Speakman, Emily et al. | 2020
- 29
-
Sequence Independent Lifting for the Set of Submodular Maximization ProblemShi, Xueyu / Prokopyev, Oleg A. / Zeng, Bo et al. | 2020
- 30
-
A Fast \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(2 + 2/7)$$\end{document}-Approximation Algorithm for Capacitated Cycle CoveringTraub, Vera / Tröbst, Thorben et al. | 2020
- 31
-
Graph Coloring Lower Bounds from Decision Diagramsvan Hoeve, Willem-Jan et al. | 2020
- 32
-
On Convex Hulls of Epigraphs of QCQPsWang, Alex L. / Kılınç-Karzan, Fatma et al. | 2020
- 33
-
On the Convexification of Constrained Quadratic Optimization Problems with Indicator VariablesWei, Linchuan / Gómez, Andrés / Küçükyavuz, Simge et al. | 2020