EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"programming: integer algorithm branch and bound"
Narrow search

Narrow search

Year of publication
Subject
All
heuristic 2 programming: integer algorithm branch and bound 2 programming: integer algorithms 2
Online availability
All
Undetermined 2
Type of publication
All
Article 2
Language
All
Undetermined 2
Author
All
Fisher, Marshall L. 2
Published in...
All
Management Science 2
Source
All
RePEc 2
Showing 1 - 2 of 2
Cover Image
The Lagrangian Relaxation Method for Solving Integer Programming Problems
Fisher, Marshall L. - In: Management Science 50 (2004) 12_supplement, pp. 1861-1871
(This article originally appeared in Management Science, January 1981, Volume 27, Number 1, pp. 1--18, published by The Institute of Management Sciences.) One of the most computationally useful ideas of the 1970s is the observation that many hard integer programming problems can be viewed as...
Persistent link: https://www.econbiz.de/10009197346
Saved in:
Cover Image
The Lagrangian Relaxation Method for Solving Integer Programming Problems
Fisher, Marshall L. - In: Management Science 27 (1981) 1, pp. 1-18
One of the most computationally useful ideas of the 1970s is the observation that many hard integer programming problems can be viewed as easy problems complicated by a relatively small set of side constraints. Dualizing the side constraints produces a Lagrangian problem that is easy to solve...
Persistent link: https://www.econbiz.de/10009214268
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...