Listing 1 - 9 of 9 |
Sort by
|
Choose an application
Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. The book draws on the research developments in three broad areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, high-level algorithm design. During the last ten years, a new body of research within the field of optimization research has emerged, which seeks to develop good approximation algorithms for classes of linear programming problems. This work both has roots in fundamental areas of mathematical programming and is also framed in the context of the modern theory of algorithms. The result of this work, in which Daniel Bienstock has been very much involved, has been a family of algorithms with solid theoretical foundations and with growing experimental success. This book will examine these algorithms, starting with some of the very earliest examples, and through the latest theoretical and computational developments.
Algorithms. --- Electronic books. -- local. --- Linear programming. --- Linear programming --- Algorithms --- Operations Research --- Calculus --- Civil & Environmental Engineering --- Mathematics --- Engineering & Applied Sciences --- Physical Sciences & Mathematics --- 519.85 --- 681.3*G16 --- 681.3*G16 Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- 519.85 Mathematical programming --- Mathematical programming --- Algorism --- Algebra --- Arithmetic --- Matrices --- Production scheduling --- Programming (Mathematics) --- Substitutions, Linear --- Transformations (Mathematics) --- Vector analysis --- Foundations --- Mathematics. --- Operations research. --- Decision making. --- Mathematical optimization. --- Calculus of variations. --- Management science. --- Calculus of Variations and Optimal Control; Optimization. --- Optimization. --- Operations Research, Management Science. --- Operation Research/Decision Theory. --- Operations Research/Decision Theory. --- Deciding --- Decision (Psychology) --- Decision analysis --- Decision processes --- Making decisions --- Management --- Management decisions --- Choice (Psychology) --- Problem solving --- Quantitative business analysis --- Operations research --- Statistical decision --- Operational analysis --- Operational research --- Industrial engineering --- Management science --- Research --- System theory --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Simulation methods --- System analysis --- Isoperimetrical problems --- Variations, Calculus of --- Decision making
Choose an application
Choose an application
Choose an application
This book constitutes the refereed proceedings of the 21st International Conference on Integer Programming and Combinatorial Optimization, IPCO 2020, held in London, UK, in June 2020. The 33 full versions of extended abstracts presented were carefully reviewed and selected from 126 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.
Integer programming --- Programming (Mathematics) --- Computer science—Mathematics. --- Data structures (Computer science). --- Computer organization. --- Computers. --- Mathematics of Computing. --- Data Structures and Information Theory. --- Computer Systems Organization and Communication Networks. --- Information Systems and Communication Service. --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Organization, Computer --- Electronic digital computers --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- Electronic data processing --- File organization (Computer science) --- Abstract data types (Computer science) --- Information theory. --- Computer engineering. --- Computer networks. --- Database management. --- Computer Engineering and Networks. --- Database Management System. --- Data base management --- Data services (Database management) --- Database management services --- DBMS (Computer science) --- Generalized data management systems --- Services, Database management --- Systems, Database management --- Systems, Generalized database management --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Network computers --- Computers --- Communication theory --- Communication --- Distributed processing --- Design and construction
Choose an application
Choose an application
Mathematics --- Computer architecture. Operating systems --- Computer. Automation --- computers --- informatica --- externe fixatie (geneeskunde
Choose an application
This book constitutes the refereed proceedings of the 21st International Conference on Integer Programming and Combinatorial Optimization, IPCO 2020, held in London, UK, in June 2020. The 33 full versions of extended abstracts presented were carefully reviewed and selected from 126 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.
Mathematics --- Computer architecture. Operating systems --- Computer. Automation --- computers --- informatica --- externe fixatie (geneeskunde
Choose an application
This volume contains the papers accepted for publication at IPCO X, the Tenth International Conference on Integer Programming and Combinatorial Optimization, held in New York City, New York, USA, June 7–11, 2004.The IPCO series of conferences presents recent results in theory, computation and applications of integer programming and combinatorial optimization. These conferences are sponsored by the Mathematical Programming Society, and are held in those years in which no International Symposium on Mathematical Programming takes place. IPCO VIII was held in Utrecht (The Netherlands) and IPCO IX was held in Cambridge (USA). A total of 109 abstracts, mostly of very high quality, were submitted. The Program Committee accepted 32, in order to meet the goal of having three days of talks with no parallel sessions. Thus, many excellent abstracts could not be accepted. The papers in this volume have not been refereed. It is expected that revised versions of the accepted papers will be submitted to standard scientific journals for publication. The Program Committee thanks all authors of submitted manuscripts for their support of IPCO. March 2004 George Nemhauser Daniel Bienstock Organization IPCO X was hosted by the Computational Optimization Research Center (CORC), Columbia University.
Integer programming --- Combinatorial optimization --- Combinatorics. --- Numeric Computing. --- Computer Graphics. --- Optimization. --- Mathematics. --- Computers. --- Algorithms. --- Numerical analysis. --- Computer science --- Applied mathematics. --- Engineering mathematics. --- Probabilities. --- Probability Theory and Stochastic Processes. --- Applications of Mathematics. --- Theory of Computation. --- Algorithm Analysis and Problem Complexity. --- Discrete Mathematics in Computer Science. --- Programming (Mathematics) --- Distribution (Probability theory. --- Information theory. --- Electronic data processing. --- Computer software. --- Computational complexity. --- Complexity, Computational --- Electronic data processing --- Machine theory --- Software, Computer --- Computer systems --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Communication theory --- Communication --- Cybernetics --- Math --- Science --- Distribution functions --- Frequency distribution --- Characteristic functions --- Probabilities --- Automation --- Computer science—Mathematics. --- Mathematical analysis --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Calculators --- Cyberspace --- Engineering --- Engineering analysis --- Algorism --- Algebra --- Arithmetic --- Probability --- Statistical inference --- Combinations --- Mathematics --- Chance --- Least squares --- Mathematical statistics --- Risk --- Foundations --- Integer programming - Congresses --- Combinatorial optimization - Congresses
Choose an application
Listing 1 - 9 of 9 |
Sort by
|