Suchergebnisse - "Unconstrained 0-1 quadratic programming"

Andere Suchmöglichkeiten:

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

    Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem von Duarte, Abraham, Laguna, Manuel, Martí, Rafael, Sánchez-Oro, Jesús

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Veröffentlicht: Kidlington Elsevier Ltd 01.11.2014
    Veröffentlicht in Computers & operations research (01.11.2014)
    “… The bipartite unconstrained 0-1 quadratic programming problem (BQP) is a difficult combinatorial problem defined on a complete graph that consists of selecting …”
    Volltext
    Journal Article
  2. 2

    The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases von Punnen, Abraham P., Sripratak, Piyashat, Karapetyan, Daniel

    ISSN: 0166-218X, 1872-6771
    Veröffentlicht: Elsevier B.V 01.10.2015
    Veröffentlicht in Discrete Applied Mathematics (01.10.2015)
    “… We consider the bipartite unconstrained 0–1 quadratic programming problem (BQP01) which is a generalization of the well studied unconstrained 0–1 quadratic …”
    Volltext
    Journal Article
  3. 3

    The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases von Punnen, Abraham P, Sripratak, Piyashat, Karapetyan, Daniel

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 28.04.2014
    Veröffentlicht in arXiv.org (28.04.2014)
    “… We consider the bipartite unconstrained 0-1 quadratic programming problem (BQP01) which is a generalization of the well studied unconstrained 0-1 quadratic programming problem …”
    Volltext
    Paper
  4. 4

    A Method for Large Scale Unconstrained Binary Quadratic Programming Problem Based on Graph Neural Network von Huang, Jiajia, Gu, Shenshen

    ISSN: 2835-9577
    Veröffentlicht: IEEE 08.03.2024
    “… obvious. Under this background, this paper demonstrates a method based on GNNs to solve large-scale Unconstrained 0-1 Quadratic Programming (UBQP) problems …”
    Volltext
    Tagungsbericht
  5. 5

    Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem von Karapetyan, Daniel, Punnen, Abraham P

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 22.07.2013
    Veröffentlicht in arXiv.org (22.07.2013)
    “… We study the Bipartite Unconstrained 0-1 Quadratic Programming Problem (BQP) which is a relaxation of the Unconstrained 0-1 Quadratic Programming Problem (QP …”
    Volltext
    Paper
  6. 6

    The generalized independent set problem: Polyhedral analysis and solution approaches von Colombi, Marco, Mansini, Renata, Savelsbergh, Martin

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Elsevier B.V 01.07.2017
    Veröffentlicht in European journal of operational research (01.07.2017)
    “… •The Generalized Independent Set Problem is studied.•The polyhedron of an integer linear programming formulation is investigated.•Linear programming based …”
    Volltext
    Journal Article
  7. 7

    The generalized vertex cover problem and some variations von Pandey, Pooja, Punnen, Abraham P

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 11.08.2017
    Veröffentlicht in arXiv.org (11.08.2017)
    “… We also study GVC on bipartite graphs and identify some polynomially solvable cases. We show that GVC on bipartite graphs is equivalent to the bipartite unconstrained 0-1 quadratic programming problem …”
    Volltext
    Paper
  8. 8

    Redundant allocation of data in a distributed relational database von Sarathy, Rathindra

    ISBN: 9798207673264
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.1990
    “… The increasing availability of computer networks and the need for managing decentralized data at several geographically remote locations, have given rise to a …”
    Volltext
    Dissertation