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
  • Optimized crossover for the in...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
Optimized crossover for the independent set problem

Optimized crossover for the independent set problem

Includes bibliographical references (p. 15-16).

Bibliographic Details
Other Authors: Aggarwal, Charu C. (Charu Chandra)
Language:eng
Published: Alfred P. Sloan School of Management, Massachusetts Institute of Technology 2003
Subjects:
HD28 .M414 no.3787-, 95
Online Access:http://hdl.handle.net/1721.1/2558
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

http://hdl.handle.net/1721.1/2558

Similar Items

  • A greedy genetic algorithm for the quadratic assignment problem
    Published: (2003)
  • Nonlinear formulations and improved randomized approximation algorithms for multiway and multicut problems
    Published: (2003)
  • Fast approximation schemes for multi-criteria flow, knapsack, and scheduling problems
    Published: (2003)
  • Fast approximation schemes for multi-criteria combinatorial optimization
    Published: (2003)
  • The achievable region method in the optimal control of queueing systems : formulations, bounds and policies
    Published: (2003)

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