Narrow your search

Library

KU Leuven (9)

Odisee (8)

Thomas More Kempen (8)

Thomas More Mechelen (8)

UCLL (8)

ULB (8)

ULiège (8)

VIVES (8)

AP (7)

KDG (7)

More...

Resource type

book (12)

digital (7)

dissertation (2)


Language

English (20)


Year
From To Submit

2023 (2)

2018 (2)

2016 (2)

2014 (2)

2013 (6)

More...
Listing 1 - 10 of 20 << page
of 2
>>
Sort by

Book
Optimization and its applications in control and data sciences : in honor of Boris T. Polyak's 80th birthday
Author:
ISBN: 3319420542 3319420569 9783319420547 Year: 2016 Publisher: New York: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book focuses on recent research in modern optimization and its implications in control and data analysis. This book is a collection of papers from the conference “Optimization and Its Applications in Control and Data Science” dedicated to Professor Boris T. Polyak, which was held in Moscow, Russia on May 13-15, 2015. This book reflects developments in theory and applications rooted by Professor Polyak’s fundamental contributions to constrained and unconstrained optimization, differentiable and nonsmooth functions, control theory and approximation. Each paper focuses on techniques for solving complex optimization problems in different application areas and recent developments in optimization theory and methods. Open problems in optimization, game theory and control theory are included in this collection which will interest engineers and researchers working with efficient algorithms and software for solving optimization problems in market and data analysis. Theoreticians in operations research, applied mathematics, algorithm design, artificial intelligence, machine learning, and software engineering will find this book useful and graduate students will find the state-of-the-art research valuable.

Keywords

Mathematics. --- Data structures (Computer science). --- Dynamics. --- Ergodic theory. --- System theory. --- Computer science --- Computer mathematics. --- Algorithms. --- Mathematical optimization. --- Optimization. --- Data Structures. --- Systems Theory, Control. --- Dynamical Systems and Ergodic Theory. --- Mathematical Applications in Computer Science. --- Science --- Technology --- Data processing. --- Electronic data processing --- Data structures (Computer scienc. --- Systems theory. --- Differentiable dynamical systems. --- Differential dynamical systems --- Dynamical systems, Differentiable --- Dynamics, Differentiable --- Differential equations --- Global analysis (Mathematics) --- Topological dynamics --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Algorism --- Algebra --- Arithmetic --- Foundations --- Computer science—Mathematics. --- Computer mathematics --- Mathematics --- Dynamical systems --- Kinetics --- Mechanics, Analytic --- Force and energy --- Mechanics --- Physics --- Statics --- Systems, Theory of --- Systems science --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science) --- Ergodic transformations --- Continuous groups --- Mathematical physics --- Measure theory --- Transformations (Mathematics) --- Philosophy --- Polyak, Boris T. --- Data structures (Computer science)


Book
Optimization Problems in Graph Theory : In Honor of Gregory Z. Gutin's 60th Birthday
Author:
ISBN: 331994830X 3319948296 Year: 2018 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin’s fundamental contributions to advanced methods and techniques in combinatorial optimization. Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems. Topics covered in this work include: · Algorithmic aspects of problems with disjoint cycles in graphs · Graphs where maximal cliques and stable sets intersect · The maximum independent set problem with special classes · A general technique for heuristic algorithms for optimization problems · The network design problem with cut constraints · Algorithms for computing the frustration index of a signed graph · A heuristic approach for studying the patrol problem on a graph · Minimum possible sum and product of the proper connection number · Structural and algorithmic results on branchings in digraphs · Improved upper bounds for Korkel--Ghosh benchmark SPLP instances.


Digital
Optimization and Its Applications in Control and Data Sciences : In Honor of Boris T. Polyak’s 80th Birthday
Author:
ISBN: 9783319420561 Year: 2016 Publisher: Cham Springer International Publishing

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book focuses on recent research in modern optimization and its implications in control and data analysis. This book is a collection of papers from the conference “Optimization and Its Applications in Control and Data Science” dedicated to Professor Boris T. Polyak, which was held in Moscow, Russia on May 13-15, 2015. This book reflects developments in theory and applications rooted by Professor Polyak’s fundamental contributions to constrained and unconstrained optimization, differentiable and nonsmooth functions, control theory and approximation. Each paper focuses on techniques for solving complex optimization problems in different application areas and recent developments in optimization theory and methods. Open problems in optimization, game theory and control theory are included in this collection which will interest engineers and researchers working with efficient algorithms and software for solving optimization problems in market and data analysis. Theoreticians in operations research, applied mathematics, algorithm design, artificial intelligence, machine learning, and software engineering will find this book useful and graduate students will find the state-of-the-art research valuable.


Digital
Optimization Problems in Graph Theory : In Honor of Gregory Z. Gutin's 60th Birthday
Author:
ISBN: 9783319948300 Year: 2018 Publisher: Cham Springer International Publishing

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin’s fundamental contributions to advanced methods and techniques in combinatorial optimization. Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems. Topics covered in this work include: · Algorithmic aspects of problems with disjoint cycles in graphs · Graphs where maximal cliques and stable sets intersect · The maximum independent set problem with special classes · A general technique for heuristic algorithms for optimization problems · The network design problem with cut constraints · Algorithms for computing the frustration index of a signed graph · A heuristic approach for studying the patrol problem on a graph · Minimum possible sum and product of the proper connection number · Structural and algorithmic results on branchings in digraphs · Improved upper bounds for Korkel--Ghosh benchmark SPLP instances.

Requirements of standards : optimization models and algorithms
Authors: ---
ISBN: 5880370089 Year: 1995 Publisher: Hoogezand Russian Operation Research Co.

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords


Dissertation
Data correcting algorithms in combinatorial optimization
Authors: ---
Year: 2002 Publisher: Groningen University of Groningen. Research institute systems, organisations and management

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords


Dissertation
Data correcting algorithms in combinatorial optimization

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords


Multi
Data Analysis and Optimization : In Honor of Boris Mirkin's 80th Birthday
Authors: ---
ISBN: 9783031316548 9783031316531 9783031316555 9783031316562 Year: 2023 Publisher: Cham Springer Nature, Imprint: Springer


Book
Data correcting approaches in combinatorial optimization
Authors: ---
ISSN: 21908354 ISBN: 1461452856 1461452864 1283697238 Year: 2012 Publisher: New York : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Data Correcting Approaches in Combinatorial Optimization focuses on algorithmic applications of the well known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems.  Researches, students and engineers will benefit from new bounds and branching rules in development efficient branch-and-bound type computational algorithms. This book examines applications for solving the Traveling Salesman Problem and its variations, Maximum Weight Independent Set Problem, Different Classes of Allocation and Cluster Analysis  as well as some classes of Scheduling Problems. Data Correcting Algorithms in Combinatorial Optimization  introduces the data correcting approach to algorithms which provide an answer to the following questions: how to construct a bound to the original intractable problem and find which element of the corrected instance  one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real world problems.


Book
Clusters, Orders, and Trees: Methods and Applications : In Honor of Boris Mirkin's 70th Birthday
Authors: --- ---
ISBN: 1493907425 1493907417 1322132909 Year: 2014 Publisher: New York, NY : Springer New York : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The volume is dedicated to Boris Mirkin on the occasion of his 70th birthday. In addition to his startling PhD results in abstract automata theory, Mirkin’s ground breaking contributions in various fields of decision making and data analysis have marked the fourth quarter of the 20th century and beyond. Mirkin has done pioneering work in group choice, clustering, data mining and knowledge discovery aimed at finding and describing non-trivial or hidden structures—first of all, clusters, orderings, and hierarchies—in multivariate and/or network data. This volume contains a collection of papers reflecting recent developments rooted in Mirkin's fundamental contribution to the state-of-the-art in group choice, ordering, clustering, data mining, and knowledge discovery. Researchers, students, and software engineers will benefit from new knowledge discovery techniques and application directions.

Listing 1 - 10 of 20 << page
of 2
>>
Sort by