UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

The Quadratic Unconstrained Binary Optimization Problem: Theory, Algorithms, and Applications

1, 2022

Volltextzugriff (PDF)

Representations of quadratic combinatorial optimization problems: A case study using quadratic set covering and quadratic knapsack problems

Computers & operations research, 2019-12, Vol.112, p.104769, Article 104769

2019

Volltextzugriff (PDF)

The Knapsack Problem with Conflict Pair Constraints on Bipartite Graphs and Extensions

Algorithms, 2024-05, Vol.17 (5), p.219

2024

Volltextzugriff (PDF)

A characterization of linearizable instances of the quadratic minimum spanning tree problem

Journal of combinatorial optimization, 2018-02, Vol.35 (2), p.436-453

2018

Volltextzugriff (PDF)

Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem

European journal of operational research, 2017-07, Vol.260 (2), p.494-506

2017

Volltextzugriff (PDF)

Satellite downlink scheduling problem: A case study

Omega (Oxford), 2015-06, Vol.53, p.115-123

2015

Volltextzugriff (PDF)

The bipartite quadratic assignment problem and extensions

European journal of operational research, 2016-05, Vol.250 (3), p.715-725

2016

Volltextzugriff (PDF)

The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis

Computers & operations research, 2014-03, Vol.43, p.20-35

2014

Volltextzugriff (PDF)

The boolean quadratic programming problem with generalized upper bound constraints

Computers & operations research, 2017-01, Vol.77, p.1-10

2017

Volltextzugriff (PDF)

Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs

European journal of operational research, 2015-03, Vol.241 (3), p.697-707

2015

Volltextzugriff (PDF)

Clustered maximum weight clique problem: Algorithms and empirical analysis

Computers & operations research, 2017-09, Vol.85, p.113-128

2017

Volltextzugriff (PDF)

Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms

Theoretical computer science, 2015-02, Vol.565, p.77-89

2015

Volltextzugriff (PDF)

The bilinear assignment problem: complexity and polynomially solvable special cases

Mathematical programming, 2017-11, Vol.166 (1-2), p.185-205

2017

Volltextzugriff (PDF)

Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms

INFORMS journal on computing, 2020-07, Vol.32 (3), p.730-746

2020

Volltextzugriff (PDF)

The Rank-One Quadratic Assignment Problem

INFORMS journal on computing, 2021-07, Vol.33 (3), p.979-996

2021

Volltextzugriff (PDF)

A GRASP for Next Generation Sapphire Image Acquisition Scheduling

International Journal of Aerospace Engineering, 2016-01, Vol.2016 (2016), p.234-240

2016

Volltextzugriff (PDF)

An effective multi-wave algorithm for solving the max-mean dispersion problem

Journal of heuristics, 2019-10, Vol.25 (4-5), p.731-752

2019

Volltextzugriff (PDF)

A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem

IEEE access, 2021, Vol.9, p.31932-31945

2021

Volltextzugriff (PDF)

A class of exponential neighbourhoods for the quadratic travelling salesman problem

Journal of combinatorial optimization, 2020-08, Vol.40 (2), p.303-332

2020

Volltextzugriff (PDF)

The minimum cost perfect matching problem with conflict pair constraints

Computers & operations research, 2013-04, Vol.40 (4), p.920-930

2013

Volltextzugriff (PDF)

A two-individual based path-relinking algorithm for the satellite broadcast scheduling problem

Knowledge-based systems, 2020-05, Vol.196, p.105774, Article 105774

2020

Volltextzugriff (PDF)

The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm

Computers & operations research, 2010-10, Vol.37 (10), p.1762-1773

2010

Volltextzugriff (PDF)

A strongly polynomial simplex method for the linear fractional assignment problem

Operations research letters, 2008-07, Vol.36 (4), p.402-407

2008

Volltextzugriff (PDF)

The balanced traveling salesman problem

Computers & operations research, 2011-05, Vol.38 (5), p.868-875

2011

Volltextzugriff (PDF)

A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics, 2002-11, Vol.123 (1), p.75-102

2002

Volltextzugriff (PDF)

1 – 25 von 151

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(105)
Mit Volltextzugriff
(146)

Publikationsform

1 weiteren anzeigen...

Weniger anzeigen...

Sprache

Englisch
(151)
Japanisch
(1)

Erscheinungsjahr

n.n

Thema

Science & Technology
(91)
Technology
(76)
Operations Research & Management Science
(55)
Algorithms
(48)
Mathematics
(41)
Computer Science
(37)
Exact Sciences And Technology
(34)
Physical Sciences
(33)
Operations Research
(31)
Applied Sciences
(30)
Studies
(30)
Mathematics, Applied
(29)
Optimization
(27)
Heuristic
(20)
Operational Research. Management Science
(20)
Operational Research And Scientific Management
(19)
Traveling Salesman Problem
(19)
Complexity
(18)
Graphs
(18)
Computer Science, Interdisciplinary Applications
(17)

15 weitere anzeigen...

Weniger anzeigen...

Neu hinzugefügt

... seit 90 Tagen
(1)

Menü

Weitere Dienste

Einstellungen

The Quadratic Unconstrained Binary Optimization Problem: Theory, Algorithms, and Applications

Representations of quadratic combinatorial optimization problems: A case study using quadratic set covering and quadratic knapsack problems

The Knapsack Problem with Conflict Pair Constraints on Bipartite Graphs and Extensions

A characterization of linearizable instances of the quadratic minimum spanning tree problem

Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem

Satellite downlink scheduling problem: A case study

The bipartite quadratic assignment problem and extensions

The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis

The boolean quadratic programming problem with generalized upper bound constraints

Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs

Clustered maximum weight clique problem: Algorithms and empirical analysis

Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms

The bilinear assignment problem: complexity and polynomially solvable special cases

Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms

The Rank-One Quadratic Assignment Problem

A GRASP for Next Generation Sapphire Image Acquisition Scheduling

An effective multi-wave algorithm for solving the max-mean dispersion problem

A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem

A class of exponential neighbourhoods for the quadratic travelling salesman problem

The minimum cost perfect matching problem with conflict pair constraints

A two-individual based path-relinking algorithm for the satellite broadcast scheduling problem

The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm

A strongly polynomial simplex method for the linear fractional assignment problem

The balanced traveling salesman problem

A survey of very large-scale neighborhood search techniques

Suchergebnisse filtern