Buy Location, Scheduling, Design and Integer Programming by Minendra P. Rijal
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Business and Economics > Business and Management > Operational research > Location, Scheduling, Design and Integer Programming: (3 International Series in Operations Research & Management Science)
37%
Location, Scheduling, Design and Integer Programming: (3 International Series in Operations Research & Management Science)

Location, Scheduling, Design and Integer Programming: (3 International Series in Operations Research & Management Science)


     0     
5
4
3
2
1



Available


X
About the Book

This monograph focuses on a class of problems that in effect have yet to be solved. Location, scheduling and design problems are assignment type problems with quadratic cost functions and occur in many contexts. Applications of these problems abound in diverse disciplines, such as anthropology, archeology, architecture, chemistry, computer science, economics, electronics, ergonomics, marketing, operations management, political science, statistical physics, zoology, etc. The book classifies mathematical properties for ten classes of assignment problems: quadratic assignment problems, travelling salesman problems, triangulation problems, linear assignment problems, VLSI circuit layout design problems, multi-processor problems, scheduling problems with interaction costs, operation-scheduling problems, graph and clique partitioning problems, and Boolean quadratic problems. They note that before these problems can be solved computationally, one must know and understand their mathematical properties. After discussing these properties, an integer programming approach is offered for solving them. The computational approach has shown considerable algorithmic success. The heart of this monograph is the theoretical work on assignment problems and the computation results that were produced using algorithms developed at NYU.

Table of Contents:
1 Location Problems.- 1.1 A Modified KB Model.- 1.2 A Symmetric KB Model.- 1.3 A Five-City Plant Location Example.- 1.4 Plant and Office Layout Planning.- 1.5 Steinberg’s Wiring Problem.- 1.6 The General Quadratic Assignment Problem.- 2 Scheduling and Design Problems.- 2.1 Traveling Salesman Problems.- 2.2 Triangulation Problems.- 2.3 Linear Assignment Problems.- 2.4 VLSI Circuit Layout Design Problems.- 2.5 Multi-Processor Assignment Problems.- 2.6 Scheduling Problems with Interaction Cost.- 2.7 Operations-Scheduling Problems.- 2.8 Graph and Clique Partitioning Problems.- 2.9 Boolean Quadric Problems and Relatives.- 2.10 A Classification of Boolean Quadratic Problems.- 3 Solution Approaches.- 3.1 Mixed zero-one formulations of QAPs.- 3.2 Branch-and-bound algorithms for QAPs.- 3.3 Traditional cutting plane algorithms.- 3.4 Heuristic procedures.- 3.5 Polynomially solvable cases.- 3.6 Computational experience to date.- 4 Locally Ideal LP Formulations I.- 4.1 Graph Partitioning Problems.- 4.2 Operations Scheduling Problems.- 4.3 Multi-Processor Assignment Problems.- 5 Locally Ideal LP Formulations II.- 5.1 VLSI Circuit Layout Design Problems.- 5.2 A General Model.- 5.3 Quadratic Assignment Problems.- 5.4 Symmetric Quadratic Assignment Problems.- 6 Quadratic Scheduling Problems.- 6.1 Alternative Formulations of the OSP.- 6.2 Quadratic Scheduling Polytopes.- 7 Quadratic Assignment Polytopes.- 7.1 The Affine Hull and Dimension of QAPn.- 7.2 Some Valid Inequalities for QAPn.- 7.3 The Affine Hull and Dimension of SQPn.- 8 Solving Small QAPs.- A Fortran Programs for Small SQPs.- References.


Best Sellers


Product Details
  • ISBN-13: 9780792397151
  • Publisher: Kluwer Academic Publishers
  • Publisher Imprint: Kluwer Academic Publishers
  • Height: 234 mm
  • No of Pages: 220
  • Returnable: Y
  • Width: 156 mm
  • ISBN-10: 0792397150
  • Publisher Date: 30 Apr 1996
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Series Title: 3 International Series in Operations Research & Management Science


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Location, Scheduling, Design and Integer Programming: (3 International Series in Operations Research & Management Science)
Kluwer Academic Publishers -
Location, Scheduling, Design and Integer Programming: (3 International Series in Operations Research & Management Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Location, Scheduling, Design and Integer Programming: (3 International Series in Operations Research & Management Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!