Výsledky vyhľadávania - combinatorial optimization integer programming knapsack problems number theory periodicity~

Integer 1/0 Knapsack Problem Dynamic Programming Approach in Building Maintenance Optimization Autor Fawzy, Viska Dewi, Sangadji, Senot, As’ad, Sholihin

“…) and the amount of damage that must be repaired.This study uses one of the optimization methods of Dynamic Programing on the application of Integer 1/0 Knapsack Problem, to determine an schedule the maintenance…”
Získať plný text

Mixed integer programming approaches to 0-1 knapsack problems and unified stochastic and robust optimization on wind power investment Autor Zhao, Kun

“… In the theoretical study, forward dynamic programming is used to generate cutting planes for an equivalent integer programming formulation of the binary knapsack problem…”
Získať plný text

Mixed Integer Linear Programming Models for Combinatorial Optimization Problems Autor Della Croce, Frédérico

“…This chapter provides an insight into mixed integer linear programming (MILP) modeling of combinatorial optimization problems…”
Získať plný text

Mixed Integer Linear Programming Models for Combinatorial Optimization Problems Autor Croce, Frédérico Della

“…This chapter contains sections titled: Introduction General modeling techniques More advanced MILP models Conclusions Bibliography…”
Získať plný text

Effective integrations of constraint programming, integer programming and local search for two combinatorial optimisation problems Autor He, Fang

“…), Integer Programming (IP) and local search (LS) to tackle two combinatorial optimisation problems from different application areas…”
Získať plný text

Mixed-integer programming approaches for some non-convex and combinatorial optimization problems Autor Sridhar, Srikrishna

“…In this dissertation we study several nonconvex and combinatorial optimization problems with applications in production planning, machine learning, advertising, statistics, and computer vision…”
Získať plný text

Hybrid mixed-integer/constraint logic programming strategies for solving scheduling and combinatorial optimization problems Autor Harjunkoski, Iiro, Jain, Vipul, Grossman, Ignacio E.

“…In this paper, we present two methods to overcome the combinatorial complexity when solving large discrete optimization problems…”
Získať plný text

Tight bounds for periodicity theorems on the unbounded Knapsack problem Autor Huang, Ping H., Lawley, Mark, Morin, Thomas

“… ► Showed two new bounds subsume known results. Three new bounds for periodicity theorems on the unbounded Knapsack problem are developed…”
Získať plný text