Skip to content
VuFind
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
    • 日本語
    • Nederlands
    • Português
    • Português (Brasil)
    • 中文(简体)
    • 中文(繁體)
    • Türkçe
    • עברית
    • Gaeilge
    • Cymraeg
    • Ελληνικά
    • Català
    • Euskara
    • Русский
    • Čeština
    • Suomi
    • Svenska
    • polski
    • Dansk
    • slovenščina
    • اللغة العربية
    • বাংলা
    • Galego
    • Tiếng Việt
    • Hrvatski
    • हिंदी
    • Հայերէն
    • Українська
    • Sámegiella
    • Монгол
Advanced
  • The lagrangian relaxation meth...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
The lagrangian relaxation method for solving integer programming problems /

The lagrangian relaxation method for solving integer programming problems /

39

Bibliographic Details
Main Author: 308936 Fisher, Marshall L.
Format:
Subjects:
Lagrangian functions
Branch and bound algorithms
  • Holdings
  • Description
  • Similar Items
  • Staff View

Similar Items

  • A group theoretic branch and bound algorithm for the zero-one integer programming problem,
    by: Shapiro, Jeremy F.
    Published: (2009)
  • Solving Spatial Optimization Problems via Lagrangian Relaxation and Automatic Gradient Computation
    by: Zhen Lei, et al.
    Published: (2025-01-01)
  • Lagrangian based approach to solve a two level capacitated lot sizing problem
    by: Mayank Verma, et al.
    Published: (2015-12-01)
  • New Algorithm to Solve Mixed Integer Quadratically Constrained Quadratic Programming Problems Using Piecewise Linear Approximation
    by: Loay Alkhalifa, et al.
    Published: (2022-01-01)
  • Lagrangian relaxation neural networks for job shop scheduling /
    by: 264010 Luh, Peter B., et al.

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs