Narrow your search

Library

KU Leuven (3)

Odisee (3)

Thomas More Kempen (3)

Thomas More Mechelen (3)

UCLL (3)

VIVES (3)

LUCA School of Arts (2)

VUB (2)

UCLouvain (1)

ULB (1)

More...

Resource type

book (3)


Language

English (3)


Year
From To Submit

2012 (3)

Listing 1 - 3 of 3
Sort by

Book
Mixed integer nonlinear programming
Authors: --- ---
ISBN: 1461419263 9786613446435 128344643X 1461419271 1493902210 Year: 2012 Publisher: New York : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Many engineering, operations, and scientific applications include a mixture of discrete and continuous decision variables and nonlinear relationships involving the decision variables that have a pronounced effect on the set of feasible and optimal solutions. Mixed-integer nonlinear programming (MINLP) problems combine the numerical difficulties of handling nonlinear functions with the challenge of optimizing in the context of nonconvex functions and discrete variables. MINLP is one of the most flexible modeling paradigms available for optimization; but because its scope is so broad, in the most general cases it is hopelessly intractable. Nonetheless, an expanding body of researchers and practitioners — including chemical engineers, operations researchers, industrial engineers, mechanical engineers, economists, statisticians, computer scientists, operations managers, and mathematical programmers — are interested in solving large-scale MINLP instances.


Book
Generalized Network Design Problems
Author:
ISBN: 1283856689 3110267683 9783110267686 9783110267693 3110267691 9783110267587 3110267586 Year: 2012 Publisher: Berlin De Gruyter

Loading...
Export citation

Choose an application

Bookmark

Abstract

Combinatorial optimization is a fascinating topic. Combinatorial optimization problems arise in a wide variety of important fields such as transportation, telecommunications, computer networking, location, planning, distribution problems, etc. Important and significant results have been obtained on the theory, algorithms and applications over the last few decades. In combinatorial optimization, many network design problems can be generalized in a natural way by considering a related problem on a clustered graph, where the original problem's feasibility constraints are expressed in terms of the clusters, i.e., node sets instead of individual nodes. This class of problems is usually referred to as generalized network design problems (GNDPs) or generalized combinatorial optimization problems. The express purpose of this monograph is to describe a series of mathematical models, methods, propositions, algorithms developed in the last years on generalized network design problems in a unified manner. The book consists of seven chapters, where in addition to an introductory chapter, the following generalized network design problems are formulated and examined: the generalized minimum spanning tree problem, the generalized traveling salesman problem, the railway traveling salesman problem, the generalized vehicle routing problem, the generalized fixed-charge network design problem and the generalized minimum vertex-biconnected network problem. The book will be useful for researchers, practitioners, and graduate students in operations research, optimization, applied mathematics and computer science. Due to the substantial practical importance of some presented problems, researchers in other areas will find this book useful, too.


Book
Mumford-Tate Groups and Domains
Authors: --- ---
ISBN: 1280494654 9786613589880 1400842735 9781400842735 9780691154244 0691154244 9780691154251 0691154252 Year: 2012 Volume: 183 Publisher: Princeton, NJ

Loading...
Export citation

Choose an application

Bookmark

Abstract

Mumford-Tate groups are the fundamental symmetry groups of Hodge theory, a subject which rests at the center of contemporary complex algebraic geometry. This book is the first comprehensive exploration of Mumford-Tate groups and domains. Containing basic theory and a wealth of new views and results, it will become an essential resource for graduate students and researchers. Although Mumford-Tate groups can be defined for general structures, their theory and use to date has mainly been in the classical case of abelian varieties. While the book does examine this area, it focuses on the nonclassical case. The general theory turns out to be very rich, such as in the unexpected connections of finite dimensional and infinite dimensional representation theory of real, semisimple Lie groups. The authors give the complete classification of Hodge representations, a topic that should become a standard in the finite-dimensional representation theory of noncompact, real, semisimple Lie groups. They also indicate that in the future, a connection seems ready to be made between Lie groups that admit discrete series representations and the study of automorphic cohomology on "ients of Mumford-Tate domains by arithmetic groups. Bringing together complex geometry, representation theory, and arithmetic, this book opens up a fresh perspective on an important subject.

Listing 1 - 3 of 3
Sort by