Volume 192, Number 1, March 2022
Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles.

Yusuke Kobayashi

电商所评分:3

Graph coloring with decision diagrams.

Willem-Jan van Hoeve

电商所评分:9

Stochastic makespan minimization in structured set systems.

Anupam Gupta Amit Kumar Viswanath Nagarajan Xiangkun Shen

电商所评分:4

Popular branchings and their dual certificates.

Telikepalli Kavitha Tamás Király Jannik Matuschke Ildikó Schlotter Ulrike Schmidt-Kraepelin

电商所评分:8

Extended formulations for stable set polytopes of graphs without two disjoint odd cycles.

Michele Conforti Samuel Fiorini Tony Huynh Stefan Weltge

电商所评分:4

Sparse representation of vectors in lattices and semigroups.

Iskander Aliev Gennadiy Averkov Jesús A. De Loera Timm Oertel

电商所评分:1

A fast $(2 + \frac{2}{7})$-approximation algorithm for capacitated cycle covering.

Vera Traub Thorben Tröbst

电商所评分:3

Single source unsplittable flows with arc-wise lower and upper bounds.

Sarah Morell Martin Skutella

电商所评分:4

Tight approximation bounds for maximum multi-coverage.

Siddharth Barman Omar Fawzi Suprovat Ghoshal Emirhan Gürpinar

电商所评分:5

Flexible Graph Connectivity.

David Adjiashvili Felix Hommelsheim Moritz Mühlenthaler

电商所评分:9

Persistency of linear programming relaxations for the stable set problem.

Elisabeth Rodríguez-Heck Karl Stickler Matthias Walter Stefan Weltge

电商所评分:4

Packing under convex quadratic constraints.

Max Klimm Marc E. Pfetsch Rico Raber Martin Skutella

电商所评分:1

Fair colorful k-center clustering.

Xinrui Jia Kshiteej Sheth Ola Svensson

电商所评分:6

About the complexity of two-stage stochastic IPs.

Kim-Manuel Klein

电商所评分:9

Constructing lattice-free gradient polyhedra in dimension two.

Joseph Paat Miriam Schlöter Emily Speakman

电商所评分:2

The integrality number of an integer program.

Joseph Paat Miriam Schlöter Robert Weismantel

电商所评分:9

Maximal quadratic-free sets.

Gonzalo Muñoz Felipe Serrano

电商所评分:4

Continuous facility location on graphs.

Tim A. Hartmann Stefan Lendl Gerhard J. Woeginger

电商所评分:1

Algorithms for flows over time with scheduling costs.

Dario Frascaria Neil Olver

电商所评分:2

On a generalization of the Chvátal-Gomory closure.

Sanjeeb Dash Oktay Günlük Dabeen Lee

电商所评分:6

Sparse graphs and an augmentation problem.

Csaba Király András Mihálykó

电商所评分:4

On generalized surrogate duality in mixed-integer nonlinear programming.

Benjamin Müller Gonzalo Muñoz Maxime Gasse Ambros M. Gleixner Andrea Lodi Felipe Serrano

电商所评分:5

Ideal formulations for constrained convex optimization problems with indicator variables.

Linchuan Wei Andrés Gómez Simge Küçükyavuz

电商所评分:8

Correction to: Idealness of k-wise intersecting families.

Ahmad Abdi Gérard Cornuéjols Tony Huynh Dabeen Lee

电商所评分:9

Idealness of k-wise intersecting families.

Ahmad Abdi Gérard Cornuéjols Tony Huynh Dabeen Lee

电商所评分:10

A technique for obtaining true approximations for k-center with covering constraints.

Georg Anegg Haris Angelidakis Adam Kurpisz Rico Zenklusen

电商所评分:7

Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2020.

Daniel Bienstock Giacomo Zambelli

电商所评分:10