Narrow your search

Library

UAntwerpen (9)

KBR (8)

UCLouvain (6)

Odisee (5)

Thomas More Kempen (5)

Thomas More Mechelen (5)

UCLL (5)

ULiège (5)

VIVES (5)

KU Leuven (4)

More...

Resource type

book (26)

digital (5)


Language

English (32)


Year
From To Submit

2022 (2)

2018 (1)

2014 (2)

2012 (3)

2004 (1)

More...
Listing 1 - 10 of 32 << page
of 4
>>
Sort by
A first course in combinatorial optimization
Author:
ISBN: 0521811511 0521010128 0511187831 9780511187834 9780521811514 9780521010122 9780511648151 0511648154 9780511616655 0511616651 1107144256 0511561555 0511186908 Year: 2004 Publisher: Cambridge, UK New York Cambridge University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

A First Course in Combinatorial Optimization is a 2004 text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.


Book
Orienting matroids representable over both GF[3] and GF[5]
Author:
Year: 1997 Publisher: Louvain-la-Neuve Center for Operations Research and Econometrics

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
Integer Programming and Combinatorial Optimization : 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014, Proceedings
Authors: ---
ISBN: 331907556X 3319075578 Year: 2014 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the refereed proceedings of the 17th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2014, held in Bonn, Germany, in June 2014. The 34 full papers presented were carefully reviewed and selected from 143 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.


Book
Local bipartite Turan graphs and graph partitioning
Authors: ---
Year: 1992 Publisher: Louvain-La-Neuve: UCL. Center for operations research and econometrics,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords


Digital
Mixed Integer Nonlinear Programming
Authors: ---
ISBN: 9781461419273 Year: 2012 Publisher: New York, NY Springer New York

Loading...
Export citation

Choose an application

Bookmark

Abstract


Digital
Integer Programming and Combinatorial Optimization : 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings
Authors: ---
ISBN: 9783319075570 Year: 2014 Publisher: Cham Springer International Publishing

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the refereed proceedings of the 17th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2014, held in Bonn, Germany, in June 2014. The 34 full papers presented were carefully reviewed and selected from 143 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.


Digital
Maximum-Entropy Sampling : Algorithms and Application
Authors: ---
ISBN: 9783031130786 9783031130779 9783031130793 9783031130809 Year: 2022 Publisher: Cham Springer International Publishing

Loading...
Export citation

Choose an application

Bookmark

Abstract

This monograph presents a comprehensive treatment of the maximum-entropy sampling problem (MESP), which is a fascinating topic at the intersection of mathematical optimization and data science. The text situates MESP in information theory, as the algorithmic problem of calculating a sub-vector of pre-specificed size from a multivariate Gaussian random vector, so as to maximize Shannon's differential entropy. The text collects and expands on state-of-the-art algorithms for MESP, and addresses its application in the field of environmental monitoring. While MESP is a central optimization problem in the theory of statistical designs (particularly in the area of spatial monitoring), this book largely focuses on the unique challenges of its algorithmic side. From the perspective of mathematical-optimization methodology, MESP is rather unique (a 0/1 nonlinear program having a nonseparable objective function), and the algorithmic techniques employed are highly non-standard. In particular, successful techniques come from several disparate areas within the field of mathematical optimization; for example: convex optimization and duality, semidefinite programming, Lagrangian relaxation, dynamic programming, approximation algorithms, 0/1 optimization (e.g., branch-and-bound), extended formulation, and many aspects of matrix theory. The book is mainly aimed at graduate students and researchers in mathematical optimization and data analytics. .


Digital
Indivisibility and divisibility polytopes
Authors: ---
Year: 2000 Publisher: Louvain-la-Neuve UCL

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
Local bipartite Turán graphs and graph partitioning
Authors: ---
Year: 1992 Publisher: Louvain-la-Neuve Center for Operations Research and Econometrics

Loading...
Export citation

Choose an application

Bookmark

Abstract

Listing 1 - 10 of 32 << page
of 4
>>
Sort by