Dual-Feasible Functions for Integer Programming and Combinatorial Optimization
Home > Business & Economics > Business & management > Organizational theory & behaviour > Dual-Feasible Functions for Integer Programming and Combinatorial Optimization
Dual-Feasible Functions for Integer Programming and Combinatorial Optimization

Dual-Feasible Functions for Integer Programming and Combinatorial Optimization


     0     
5
4
3
2
1



International Edition


About the Book

Linear and Integer Programming.- Classical Dual-feasible Functions.- General Dual-feasible Functions.- Applications for Cutting and Packing Problems.- Other Applications in General Integer Programming.
About the Author:

Cláudio Alves is Associate Professor of Operations Research at the Department of Production and Systems, School of Engineering, University of Minho, Portugal. He received his M.Sc., Ph.D. and Habilitation degrees in Industrial and Systems Engineering from the University of Minho. He has published more than 60 papers that appeared in international volumes and journals such as European Journal of Operational Research, Computers and Operations Research, INFORMS Journal on Computing, Operations Research Letters and Annals of Operations Research.His main scientific interests include the development and analysis of integer programming models and solution methods with an emphasis on decomposition-based approaches, combinatorial optimization, heuristics, metaheuristics and matheuristics, integrated optimization problems, applications of mixed integer programming to production and supply chain management, and the development of optimization software and decision support systems.

François Clautiaux is Professor of Operations Research at the Mathematic Department of the University of Bordeaux, France. He received both his M.Sc. and Ph.D. degrees from the University of Technology of Compiègne, France. He has published in international journals including European Journal of Operational Research, Discrete Applied Mathematics, Discrete Optimization, INFORMS Journal on Computing, Computers and Operations Research, and Annals of Operations Research.His research interests are focused on methods based on integer programming, and their applications to several fields including cutting and packing, employee scheduling, vehicle routing, and clustering.

José Valério de Carvalho graduated in engineering at the Faculdade de Engenharia da Universidade do Porto, and received his M.Sc. degree in Industrial Engineering and Operations Research from the Virginia Polytechnic Institute and State University, and his Ph.D. degree in Engineering Production and Operations Research from the University of Minho. He is currently Professor of Operations Research at the Department of Production and Systems, School of Engineering, University of Minho, Portugal, and head of the department.His main research areas of interest are pseudo-polynomial models, column generation and heuristics, and their application in large scale integer programming in the areas of cutting and packing, scheduling, and routing. Other topics of interest are stabilization and acceleration of column generation. He has published in Operations Research, European Journal of Operational Research, Computers and Operations Research, Annals of Operations Research, Computational Optimization and Applications, Optimization Letters, INFORMS Journal on Computing, Journal of the Operational Research Society, Networks and other journals.He has been invited speaker and member of the scientific committee of several international conferences and President of APDIO (the Portuguese Operations Research Association).

Jürgen Rietz studied mathematics and earned his diploma degree from the Technische Universität Dresden, and received the doctor degree (Ph.D.) from the Technische Universität Bergakademie Freiberg (Technical University for Mining and Technology). He investigated dual-feasible functions (DFF) at the Universidade do Minho, Portugal. He is co-author of several scientific contributions in journals like Discrete Applied Mathematics, Optimization, Operations Research Letters, INFORMS Journal on Computing, Optimization Letters, European Journal of Operational Research and in proceedings of international conferences. His research topics comprise the one-dimensional cutting stock problem, two- and three-dimensional container loading, non-linear optimization and DFF.


Best Sellers



Product Details
  • ISBN-13: 9783319801834
  • Publisher: Springer
  • Publisher Imprint: Springer
  • Height: 234 mm
  • No of Pages: 159
  • Series Title: Euro Advanced Tutorials on Operational Research
  • Sub Title: Basics, Extensions and Applications
  • Width: 156 mm
  • ISBN-10: 331980183X
  • Publisher Date: 30 Mar 2018
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Spine Width: 9 mm
  • Weight: 299 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Dual-Feasible Functions for Integer Programming and Combinatorial Optimization
Springer -
Dual-Feasible Functions for Integer Programming and Combinatorial Optimization
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.

Dual-Feasible Functions for Integer Programming and Combinatorial Optimization

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

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!