Suchergebnisse - "Non-linear boolean programming"

  • Treffer 1 - 11 von 11
Treffer weiter einschränken
  1. 1

    Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints

    Autoren: Nir Halman Hans Kellerer Vitaly A. Strusevich

    Quelle: European Journal of Operational Research. 270:435-447

    Schlagwörter: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, QA, 01 natural sciences

    Dateibeschreibung: application/pdf

    Zugangs-URL: https://www.sciencedirect.com/science/article/abs/pii/S0377221718303163
    https://core.ac.uk/display/158351267
    https://ideas.repec.org/a/eee/ejores/v270y2018i2p435-447.html
    https://dblp.uni-trier.de/db/journals/eor/eor270.html#HalmanKS18
    https://www.sciencedirect.com/science/article/pii/S0377221718303163
    https://gala.gre.ac.uk/id/eprint/20042/

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  2. 2

    Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints

    Autoren: Halman, Nir Kellerer, Hans Strusevich, Vitaly A.

    Relation: http://www.sciencedirect.com/science/article/pii/S0377221718303163

    Verfügbarkeit: http://www.sciencedirect.com/science/article/pii/S0377221718303163

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  3. 3

    Strongly Polynomial FPTASes for Monotone Dynamic Programs.

    Autoren: Alon, Tzvi Halman, Nir

    Quelle: Algorithmica; Oct2022, Vol. 84 Issue 10, p2785-2819, 35p

    Schlagwörter: POLYNOMIAL approximation, POLYNOMIALS, POLYNOMIAL time algorithms, SET functions, BACKPACKS, COUNTING, VEHICLE routing problem

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  4. 4

    AUTOMATIC GENERATION OF FPTASes FOR STOCHASTIC MONOTONE DYNAMIC PROGRAMS MADE EASIER.

    Autoren: ALON, TZVI HALMAN, NIR

    Quelle: SIAM Journal on Discrete Mathematics; 2021, Vol. 35 Issue 4, p2679-2722, 44p

    Schlagwörter: SET functions, OPERATIONS research, COMPUTER science, CALCULUS, STOCHASTIC programming, DYNAMIC programming

    Nájsť tento článok vo Web of Science
    Zu den Favoriten
  5. 5

    A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times.

    Autoren: Halman, Nir

    Quelle: Journal of Scheduling; 2020, Vol. 23 Issue 6, p643-648, 6p

    Schlagwörter: POLYNOMIAL approximation, POLYNOMIAL time algorithms, PRODUCTION scheduling, SET functions

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  6. 6

    Bi-criteria path problem with minimum length and maximum survival probability.

    Autoren: Halman, Nir Kovalyov, Mikhail Y. Quilliot, Alain et al.

    Quelle: OR Spectrum; Jun2019, Vol. 41 Issue 2, p469-489, 21p

    Schlagwörter: MAXIMA & minima, MATHEMATICAL optimization, APPROXIMATION algorithms, NP-complete problems, POLYNOMIAL approximation, ARC length, POLYNOMIAL time algorithms

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  7. 7

    Modular System Synthesis: Example for Composite Packaged Software.

    Autoren: Levin, Mark Sh.

    Quelle: IEEE Transactions on Systems, Man & Cybernetics: Part C - Applications & Reviews; Nov2005, Vol. 35 Issue 4, p544-553, 10p

    Schlagwörter: INTEGRATED circuit interconnections, SOFTWARE compatibility, COMPUTER software development, NP-complete problems, DATABASE management, MODULES (Algebra)

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  8. 8

    A GPU-Enabled Compact Genetic Algorithm for Very Large-Scale Optimization Problems.

    Autoren: Ferigo, Andrea Iacca, Giovanni

    Quelle: Mathematics (2227-7390); May2020, Vol. 8 Issue 5, p758, 1p

    Schlagwörter: GENETIC algorithms, COMPUTER performance, INDUSTRIAL engineering, MATERIALS, CHEMICAL engineers, EVOLUTIONARY algorithms

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  9. 9

    Mathematical Optimization Theory and Operations Research : 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8 - 12, 2019, Revised Selected Papers

    Autoren: Igor Bykadorov Vitaly Strusevich Tatiana Tchemisova

    Resource Type: eBook.

    Schlagworte: Computer science—Mathematics, Artificial intelligence, Algorithms, Computer networks, Artificial intelligence—Data processing, Computer science

    Categories: MATHEMATICS / Applied, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Computer Science, COMPUTERS / Database Administration & Management, COMPUTERS / Networking / General, COMPUTERS / Programming / Algorithms

    Zu den Favoriten
  10. 10

    Mathematical Optimization Theory and Operations Research : 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings

    Autoren: Michael Khachay Yury Kochetov Panos Pardalos

    Resource Type: eBook.

    Schlagworte: Computer science—Mathematics, Numerical analysis, Discrete mathematics, Algorithms, Artificial intelligence, Artificial intelligence—Data processing

    Categories: MATHEMATICS / Applied, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Computer Science, COMPUTERS / Database Administration & Management, COMPUTERS / Programming / Algorithms, MATHEMATICS / Discrete Mathematics, MATHEMATICS / Numerical Analysis

    Zu den Favoriten
  11. 11

    Computer Network Security : 5th International Conference, on Mathematical Methods, Models, and Architectures for Computer Network Security, MMM-ACNS 2010, St. Petersburg, Russia, September 8-10, 2010, Proceedings

    Autoren: Igor Kotenko Victor Skormin

    Resource Type: eBook.

    Schlagworte: Computer security--Congresses, Computer networks--Security measures--Congress, Computer networks--Access control--Congresses

    Categories: COMPUTERS / Networking / General

    Zu den Favoriten

Suchwerkzeuge: