Linear and Integer Programming vs Linear Integration and Counting - Springer Series in Operations Research and Financial Engineering
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer New York

9780387094137, 9780387094144

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Barvinok’s Counting Algorithm and Gomory Relaxations

Linear and Integer Programming vs Linear Integration and Counting - Springer Series in Operations Research and Financial Engineering ◽

10.1007/978-0-387-09414-4_7 ◽

2009 ◽

pp. 107-113

Author(s):

Jean-Bemard Lasserre

Keyword(s):

Counting Algorithm

The Linear Integration Problem I

Linear and Integer Programming vs Linear Integration and Counting - Springer Series in Operations Research and Financial Engineering ◽

10.1007/978-0-387-09414-4_2 ◽

2009 ◽

pp. 9-29

Author(s):

Jean-Bemard Lasserre

Keyword(s):

Linear Integration ◽

Integration Problem

Relating the Discrete Problems Pd and Id with P

Linear and Integer Programming vs Linear Integration and Counting - Springer Series in Operations Research and Financial Engineering ◽

10.1007/978-0-387-09414-4_5 ◽

2009 ◽

pp. 71-79

Author(s):

Jean-Bemard Lasserre

Keyword(s):

Discrete Problems

Duality and Superadditive Functions

Linear and Integer Programming vs Linear Integration and Counting - Springer Series in Operations Research and Financial Engineering ◽

10.1007/978-0-387-09414-4_10 ◽

2009 ◽

pp. 139-147

Author(s):

Jean-Bemard Lasserre

Keyword(s):

Superadditive Functions

Introduction

Linear and Integer Programming vs Linear Integration and Counting - Springer Series in Operations Research and Financial Engineering ◽

10.1007/978-0-387-09414-4_1 ◽

2009 ◽

pp. 1-5

Author(s):

Jean-Bemard Lasserre

A Discrete Farkas Lemma

Linear and Integer Programming vs Linear Integration and Counting - Springer Series in Operations Research and Financial Engineering ◽

10.1007/978-0-387-09414-4_8 ◽

2009 ◽

pp. 115-129

Author(s):

Jean-Bemard Lasserre

Keyword(s):

Farkas Lemma

Duality and Gomory Relaxations

Linear and Integer Programming vs Linear Integration and Counting - Springer Series in Operations Research and Financial Engineering ◽

10.1007/978-0-387-09414-4_6 ◽

2009 ◽

pp. 83-106

Author(s):

Jean-Bemard Lasserre

The Linear Counting Problem Id

Linear and Integer Programming vs Linear Integration and Counting - Springer Series in Operations Research and Financial Engineering ◽

10.1007/978-0-387-09414-4_4 ◽

2009 ◽

pp. 41-69

Author(s):

Jean-Bemard Lasserre

Keyword(s):

Counting Problem

Comparing the Continuous Problems P and I

Linear and Integer Programming vs Linear Integration and Counting - Springer Series in Operations Research and Financial Engineering ◽

10.1007/978-0-387-09414-4_3 ◽

2009 ◽

pp. 31-37

Author(s):

Jean-Bemard Lasserre

Keyword(s):

Continuous Problems

The Integer Hull of a Convex Rational Polytope

Linear and Integer Programming vs Linear Integration and Counting - Springer Series in Operations Research and Financial Engineering ◽

10.1007/978-0-387-09414-4_9 ◽

2009 ◽

pp. 131-138

Author(s):

Jean-Bemard Lasserre

Keyword(s):

Rational Polytope ◽

Integer Hull

Linear and Integer Programming vs Linear Integration and Counting - Springer Series in Operations Research and Financial EngineeringLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer New York

Barvinok’s Counting Algorithm and Gomory Relaxations

The Linear Integration Problem I

Relating the Discrete Problems Pd and Id with P

Duality and Superadditive Functions

Introduction

A Discrete Farkas Lemma

Duality and Gomory Relaxations

The Linear Counting Problem Id

Comparing the Continuous Problems P and I

The Integer Hull of a Convex Rational Polytope

Linear and Integer Programming vs Linear Integration and Counting - Springer Series in Operations Research and Financial Engineering
Latest Publications