Suchergebnisse - combinatorial optimization integer programming knapsack problems number theory periodicity~

Tight bounds for periodicity theorems on the unbounded Knapsack problem

Autoren: Huang, Ping H. Lawley, Mark Morin, Thomas

Quelle: European Journal of Operational Research. Dec2011, Vol. 215 Issue 2, p319-324. 6p.

Schlagwörter: *INTEGER programming, *OPERATIONS research, *DYNAMIC programming, *MATHEMATICAL programming, *PROFIT maximization, KNAPSACK problems, COMBINATORIAL optimization, NUMBER theory

Irregular polyomino tiling via integer programming with application in phased array antenna design.

Autoren: Karademir, Serdar Prokopyev, Oleg Mailloux, Robert

Quelle: Journal of Global Optimization; Jun2016, Vol. 65 Issue 2, p137-173, 37p

Schlagwörter: POLYOMINOES, COMBINATORIAL designs & configurations, COMBINATORICS, BLOCK designs, TILING (Mathematics)

Dynamic-Programming-Based Inequalities for the Unbounded Integer Knapsack Problem.

Alternate Title: Dinaminiu programavimu pagrįstos nelygybės neapribotam sveikaskaitiniam kuprinės uždaviniui spręsti. (Lithuanian)

Autoren: Xueqi HE HARTMAN, Joseph C. PARDALOS, Panos M.

Quelle: Informatica; 2016, Vol. 27 Issue 2, p433-450, 18p

Schlagwörter: DYNAMIC programming, MATHEMATICAL inequalities, KNAPSACK problems, INTEGERS, COMPUTER performance

Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems.

Autoren: Li, Jian Deshpande, Amol

Quelle: Mathematics of Operations Research; Feb2019, Vol. 44 Issue 1, p354-375, 22p

Schlagwörter: EXPECTED utility, STOCHASTIC processes, COMBINATORIAL optimization, PROBLEM solving, UTILITY functions

The problem with integer programming.

Autoren: Williams, H. P.

Quelle: IMA Journal of Management Mathematics; Jul2011, Vol. 22 Issue 3, p213-230, 18p

Schlagwörter: INTEGER programming, MONOIDS, COMPUTATIONAL mathematics, MATHEMATICAL optimization, LINEAR programming, MATHEMATICS, ECONOMICS

The White Puzzle: A Framework for Computation as a Recursive‑Harmonic Phenomenon

Autoren: KULIK, DEAN

Metaheuristics for dynamic combinatorial optimization problems.

Autoren: Yang, Shengxiang Jiang, Yong Nguyen, Trung Thanh

Quelle: IMA Journal of Management Mathematics; Oct2013, Vol. 24 Issue 4, p451-480, 30p

Schlagwörter: METAHEURISTIC algorithms, COMBINATORIAL optimization, DECISION making, MATHEMATICAL variables, CONSTRAINT satisfaction, GENETIC algorithms, ANT algorithms

Mixed-Integer Cuts from Cyclic Groups.

Autoren: Fischetti, Matteo Saturni, Cristiano

Quelle: Mathematical Programming; Jan2007, Vol. 109 Issue 1, p27-53, 27p, 1 Diagram, 11 Charts, 3 Graphs

Schlagwörter: INTEGER programming, ALGEBRAIC functions, ALGORITHMS, MATHEMATICAL programming, MATHEMATICAL optimization, MATHEMATICAL analysis

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case.

Autoren: Basu, Amitabh Hildebrand, Robert Köppe, Matthias

Quelle: Mathematics of Operations Research; Feb2015, Vol. 40 Issue 1, p105-129, 25p

Schlagwörter: PERTURBATION theory, INFINITE groups, ALGORITHMS, MATHEMATICAL functions, INTEGER programming

Valid inequalities for MIPs and group polyhedra from approximate liftings.

Autoren: Richard, Jean-Philippe Li, Yanjun Miller, Lisa

Quelle: Mathematical Programming; May2009, Vol. 118 Issue 2, p253-277, 25p, 4 Graphs

Schlagwörter: ALGEBRAIC number theory, GROUP problem solving, POLYHEDRAL functions, MODULAR functions, ALGEBRA, MATHEMATICAL analysis

On periodic resource scheduling for continuous-media databases.

Autoren: Garofalakis, Minos N. Özden, Banu Silberschatz, Avi

Quelle: VLDB Journal International Journal on Very Large Data Bases; Dec1998, Vol. 7 Issue 4, p206-225, 20p

A new and faster representation for counting integer points in parametric polyhedra.

Autoren: Gribanov, Dmitry V. Malyshev, Dmitry S. Pardalos, Panos M. et al.

Quelle: Computational Optimization & Applications; Dec2025, Vol. 92 Issue 3, p811-861, 51p

Schlagwörter: POLYNOMIAL time algorithms, POLYTOPES, SPARSE matrices, MATHEMATICAL functions, CARDINAL numbers, OPTIMIZATION algorithms

Energy landscapes—Past, present, and future: A perspective.

Autoren: Schön, J. C.

Quelle: Journal of Chemical Physics; 8/7/2024, Vol. 161 Issue 5, p1-39, 39p

Schlagwörter: COST functions, GLOBAL optimization, ENERGY development, BUSINESS models, PHYSICS

Profit optimized task scheduling for vehicular fog computing.

Autoren: Saleem, Umber Jangsher, Sobia Li, Tong et al.

Quelle: Wireless Networks (10220038); Jan2025, Vol. 31 Issue 1, p759-777, 19p

Schlagwörter: RESOURCE allocation, INCENTIVE (Psychology), EDGE computing, USER charges, NONLINEAR equations

Preface: Introducing operations research trends at CLAIO XVIII.

Autoren: Maturana, Sergio Ríos-Mercado, Roger Z. Vera, Jorge

Quelle: Annals of Operations Research; Mar2020, Vol. 286 Issue 1/2, p1-9, 9p

Schlagwörter: OPERATIONS research, MATHEMATICAL models, ELECTRIC power system planning, THIRD-party logistics, MIXED integer linear programming

Sine Cosine Algorithm for Optimization

Autoren: Jagdish Chand Bansal Prathu Bajpai Anjali Rawat et al.

Resource Type: eBook.

Schlagworte: Mathematical optimization, Metaheuristics, Computer programming

Categories: COMPUTERS / Artificial Intelligence / General, COMPUTERS / Programming / Algorithms, TECHNOLOGY & ENGINEERING / Engineering (General), MATHEMATICS / Optimization

Graver bases of shifted numerical semigroups with 3 generators.

Autoren: Howard, James O'Neill, Christopher

Quelle: Journal of Algebra & Its Applications; Aug2025, Vol. 24 Issue 9, p1-19, 19p

Schlagwörter: INTEGERS, FACTORIZATION, TOMBS, COLLECTIONS, FAMILIES

Positive semidefinite penalty method for quadratically constrained quadratic programming.

Autoren: Gu, Ran Du, Qiang Yuan, Ya-xiang

Quelle: IMA Journal of Numerical Analysis; Oct2021, Vol. 41 Issue 4, p2488-2515, 28p

Schlagwörter: QUADRATIC programming, SEMIDEFINITE programming, ALGORITHMS, PROBLEM solving, NP-hard problems, WIRELESS communications

Content caching in mobile edge computing: a survey.

Autoren: Khan, Yasar Mustafa, Saad Ahmad, Raja Wasim et al.

Quelle: Cluster Computing; Oct2024, Vol. 27 Issue 7, p8817-8864, 48p

Schlagwörter: MOBILE computing, WIRELESS communications, EDGE computing, TELECOMMUNICATION, CELL phones, BANDWIDTH allocation

Short-depth QAOA circuits and quantum annealing on higher-order ising models.

Autoren: Pelofske, Elijah Bärtschi, Andreas Eidenbenz, Stephan

Quelle: NPJ Quantum Information; 3/12/2024, Vol. 10 Issue 1, p1-19, 19p

Schlagwörter: QUANTUM annealing, ISING model, QUANTUM operators, GRAPH connectivity, QUBITS