Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Tomasz P. Pawlak"'
Autor:
Tomasz P. Pawlak, Bartosz Górka
Publikováno v:
Bulletin of the Polish Academy of Sciences: Technical Sciences, Vol 71, Iss 1 (2022)
Business processes are omnipresent in nowadays economy: companies operate repetitively to achieve their goals, e.g., deliver goods, complete orders. The business process model is the key to understanding, managing, controlling, and verifying the oper
Externí odkaz:
https://doaj.org/article/8301ac8620fd4f2aaf8c8a647e3177d9
Publikováno v:
European Journal of Operational Research. 303:1304-1320
Autor:
Tomasz P. Pawlak, Bartosz Litwiniuk
Publikováno v:
European Journal of Operational Research. 293:36-49
We propose Ellipsoidal One-Class Constraint Acquisition (EOCCA), a fast and scalable algorithm for the acquisition of constraints for Mixed-Integer Quadratically Constrained Programming (MIQCP) models from data. EOCCA acquires a well-formed MIQCP mod
Autor:
Tomasz P. Pawlak
Publikováno v:
Swarm and Evolutionary Computation. 44:335-348
We propose an Evolutionary Strategy-based One Class Constraint Synthesis ( ESOCCS ), a novel method for computer-assisted synthesis of constraints for Mathematical Programming models. ESOCCS synthesizes constraints of Linear Programming and Non-Linea
Autor:
Tomasz P. Pawlak, Krzysztof Krawiec
Publikováno v:
IEEE Transactions on Evolutionary Computation. 23:117-129
Mathematical programming (MP) models are common in optimization of real-world processes. Models are usually built by optimization experts in an iterative manner: an imperfect model is continuously improved until it approximates the reality well-enoug
Autor:
Tomasz P. Pawlak, Marcin Karmelita
Publikováno v:
GECCO
We propose CMA-ES for One-Class Constraint Synthesis (CMAESOCCS), a method that synthesizes Mixed-Integer Linear Programming (MILP) model from exemplary feasible solutions to this model using Covariance Matrix Adaptation - Evolutionary Strategy (CMA-
Autor:
Tomasz P. Pawlak, Patryk Kudła
Publikováno v:
Applied Soft Computing. 68:1-12
We propose Constraint Synthesis with C4.5 ( CSC4.5 ), a novel method for automated construction of constraints for Mixed-Integer Linear Programming (MILP) models from data. Given a sample of feasible states of a modeled entity, e.g., a business proce
Autor:
Tomasz P. Pawlak, Krzysztof Krawiec
Publikováno v:
European Journal of Operational Research. 261:1141-1157
Constraints form an essential part of most practical search and optimization problems, and are usually assumed to be given. However, there are plausible real-world scenarios in which constraints are not known or can be only approximated, for instance
Autor:
Tomasz P. Pawlak, Michael O'Neill
Publikováno v:
Swarm and Evolutionary Computation. 64:100896
The Mixed-Integer Linear Programming models are a common representation of real-world objects. They support simulation within the expressed bounds using constraints and optimization of an objective function. Unfortunately, handcrafting a model that a
Autor:
Tomasz P. Pawlak
Publikováno v:
GECCO
Mathematical Programming (MP) models are common in optimization of systems. Designing those models, however, is challenging for human experts facing deficiencies in domain knowledge, rigorous technical requirements for the model (e.g., linearity) or