Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Mathematics Of Computing (G) > Numerical Analysis (G.1) > Optimization (G.1.6) > Integer Programming (G.1.6...)  
 
Options:
 
  1-10 of 12 Reviews about "Integer Programming (G.1.6...)": Date Reviewed
   Approximating integer programs with positive right-hand sides
Jonsson P., Thapper J. Information Processing Letters 110(10): 351-355, 2010.  Type: Article

Jonsson and Thapper’s paper deals with integer problems that are constrained by positive right-hand sides and that seek to minimize an objective function. Such problems can be approximated so they are easier to solve....

Jun 2 2011
   The sharpest cut: the impact of Manfred Padberg and his work (MPS-SIAM Series on Optimization)
Grötschel M., Padberg M., Society for Industrial and Applied Mathematics, Philadelphia, PA, 2004. 380 pp.  Type: Book (9780898715521)

Researchers will find this book--a collection of papers written to honor Manfred Padberg on the occasion of his sixtieth birthday--to be extremely useful as a reference on various aspects of combinatorics. The papers ...

Jun 30 2005
  Damage Assessment for Optimal Rollback Recovery
Lin T., Shin K. IEEE Transactions on Computers 47(5): 603-613, 1998.  Type: Article

Distributed processing creates special problems in reconciling the work performed by the computational modules. Faults can occur and be propagated as computational errors in the module itself and in other modules. When this situation i...

Aug 1 1998
  Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
Resende M., Pardalos P., Li Y. ACM Transactions on Mathematical Software 22(1): 104-118, 1996.  Type: Article

The authors describe computer software that can be used for the treatment of large-scale quadratic assignment problems where n facilities are to be assigned to n sites at minimum cost. This problem...

Dec 1 1996
  Integer programs for logic constraint satisfaction
Monfroglio A. Theoretical Computer Science 97(1): 105-130, 1992.  Type: Article

Logic constraint satisfaction problems (CSPs) are in general NP-hard, and no general deterministic polynomial-time algorithm is known. Several logic constraint problems can be reduced in polynomial time to the satisfaction of a conjun...

Mar 1 1993
  Knapsack problems: algorithms and computer implementations
Martello S., Toth P. (ed), John Wiley & Sons, Inc., New York, NY, 1990.  Type: Book (9780471924203)

The chapter headings indicate the contents of this book:

  • Introduction...
Feb 1 1992
  Construction of test problems in quadratic bivalent programming
Pardalos P. (ed) ACM Transactions on Mathematical Software 17(1): 74-87, 1991.  Type: Article

Pardalos gives explicit FORTRAN code to generate test problems with numerically correct answers for constrained bivalent quadratic programming formulations. The problem considered has the form minx f ( x ) = c...

Sep 1 1991
  Integer programming vs. expert systems: an experimental comparison
Dhar V., Ranganathan N. Communications of the ACM 33(3): 323-336, 1990.  Type: Article

The authors observe that many constraint satisfaction problems can be viewed in an operations research or artificial intelligence framework. This observation has been made by others as well, but the main contribution of this paper is t...

Oct 1 1990
  Crossword compilation using integer programming
Wilson J. The Computer Journal 32(3): 273-275, 1989.  Type: Article

This paper explores the performance of integer programming on the problem of crossword compilation (that is, constructing solution sets to a crossword puzzle of a given shape). Experiments were done with an integer programming approach...

Apr 1 1990
  Integer and combinatorial optimization
Nemhauser G., Wolsey L., Wiley-Interscience, New York, NY, 1988.  Type: Book (9789780471828198)

Intended as both a reference and a graduate text, this book is directed toward mathematically mature readers, although the only specific prerequisite is a background in linear programming....

Mar 1 1989
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy