R. Weismantel

Publications200
h-index36
Citations4,606
Highly Influential Citations283
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • S. Onn
  • 128 Publications • 1,840 Citations
  • L. Wolsey
  • 213 Publications • 25,702 Citations
  • F. Eisenbrand
  • 115 Publications • 2,187 Citations
  • G. Cornuéjols
  • 251 Publications • 9,567 Citations
  • Publications
  • Influence
Optimization over integers
  • 341
  • 31
A Logical Model Provides Insights into T Cell Receptor Signaling
TLDR
A large-scale Boolean model for T cell activation is applied to the functional analysis of the complex signaling network governing the activation of T cells via the T cell receptor, the CD4/CD8 co-receptor, and the accessory signaling receptor CD28. Expand
  • 305
  • 17
  • PDF
Nonlinear Integer Programming
TLDR
We present the summation formula of an infinite geometric series: g1(z) = 1 1 1 + · · ·+ 1n−1 + 1n = n + 1. Expand
  • 247
  • 16
  • PDF
Inequalities from Two Rows of a Simplex Tableau
TLDR
In this paper we explore the geometry of the integer points in a cone rooted at a rational point. Expand
  • 126
  • 12
  • PDF
Cutting Planes form Two Rows of a Simplex Tableau
  • 54
  • 9
  • PDF
Transversal numbers over subsets of linear spaces
Let $M$ be a subset of $\mathbb{R}^k$. It is an important question in the theory of linear inequalities to estimate the minimal number $h=h(M)$ such that every system of linear inequalities which is… Expand
  • 36
  • 9
  • PDF
A Semidefinite Programming Approach to the Quadratic Knapsack Problem
In order to gain insight into the quality of semidefinite relaxations of constrained quadratic 0/1 programming problems we study the quadratic knapsack problem. We investigate several basic… Expand
  • 112
  • 8
  • PDF
Test sets of integer programs
  • R. Weismantel
  • Mathematics, Computer Science
  • Math. Methods Oper. Res.
  • 1 February 1998
TLDR
This article is a survey about recent developments in the area of test sets of families of linear integer programs and their relation to the augmentation problem. Expand
  • 34
  • 8
Cutting planes in integer and mixed integer programming
TLDR
This survey presents cutting planes that are useful or potentially useful in solving mixed integer programs. Expand
  • 215
  • 7
On the 0/1 knapsack polytope
  • R. Weismantel
  • Mathematics, Computer Science
  • Math. Program.
  • 1 April 1997
This paper deals with the 0/1 knapsack polytope. In particular, we introduce the class ofweight inequalities. This class of inequalities is needed to describe the knapsack polyhedron when the weights… Expand
  • 113
  • 7
...
1
2
3
4
5
...