Sciweavers

205 search results - page 10 / 41
» Valid inequalities for mixed integer linear programs
Sort
View
MP
2006
88views more  MP 2006»
13 years 8 months ago
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCorm...
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
14 years 3 months ago
Integer Polyhedra for Program Analysis
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
Philip J. Charles, Jacob M. Howe, Andy King
CISS
2008
IEEE
14 years 3 months ago
A linear integer programming approach to analyze P2P media streaming
Recent advancement in peer-to-peer (P2P) technologies has enabled a wide range of new applications. In this paper, we present mixed integer programming (MIP) formulations to analy...
Fulu Li, Jianwei Huang, Andrew Lippman
EUSFLAT
2007
124views Fuzzy Logic» more  EUSFLAT 2007»
13 years 10 months ago
Mixed Integer Programming, General Concept Inclusions and Fuzzy Description Logics
Fuzzy Description Logics (fuzzy DLs) have been proposed as a language to describe structured knowledge with vague concepts. In [23], a solution based on Mixed Integer Linear Progr...
Umberto Straccia, Fernando Bobillo
COCOA
2010
Springer
13 years 6 months ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...