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...

0.05% 20ppm/ C Drift Precision Series Voltage Reference with Shutdown Enable ۝ 5-SOT-23 -40 to 125

ECN, 2017-08

2017

Volltextzugriff (PDF)

0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets

SIAM journal on discrete mathematics, 2006-10, Vol.20 (4), p.893-912

Fiorini, Samuel

2006

Volltextzugriff (PDF)

A 0.1–4 GHz SDR receiver with reconfigurable 10–100 MHz signal bandwidth in 65 nm CMOS

Analog integrated circuits and signal processing, 2013-12, Vol.77 (3), p.567-582

2013

Volltextzugriff (PDF)

A 0-1 AUGMENTED GOAL PROGRAMMING APPROACH TO THE CAPITAL BUDGETING PROBLEM WITH MULTIPLE OBJECTIVES

CHA, OK HWAN

1983

Volltextzugriff (PDF)

A 0-1 integer programming approach to a university timetabling problem

Hacettepe Journal of Mathematics and Statistics, 2008, Vol.37 (1), p.41-55

2008

Volltextzugriff (PDF)

0-1 Integer Programming for Generation Maintenance Scheduling in Power Systems Based on Teaching Learning Based Optimization (TLBO)

Contemporary Computing, Vol.306, p.53-63

Volltextzugriff (PDF)

A 0-1 integer programming model for the simultaneous allocation of operations of part types and grouping of machine-tool combinations

Foulger, Franklin Samuel Jaiselvan

1997

Volltextzugriff (PDF)

The 0–1 inverse maximum stable set problem

Discrete Applied Mathematics, 2008-07, Vol.156 (13), p.2501-2516

2008

Volltextzugriff (PDF)

0-1 Knapsack in Nearly Quadratic Time

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, p.271-282

Jin, Ce

2024

Volltextzugriff (PDF)

0/1 Knapsack on Hardware: A Complete Solution

2007 IEEE International Conf. on Application-specific Systems, Architectures and Processors (ASAP), 2007, p.160-167

2007

Volltextzugriff (PDF)

The 0-1 Knapsack Polytope – A Starting Point for Cryptanalysis of Knapsack Ciphers?

Applications and Techniques in Information Security, p.171-182

Volltextzugriff (PDF)

0-1 Knapsack Problem Solving using Genetic Optimization Algorithm

Engineering and Technology Journal, 2024-07, Vol.9 (7)

2024

Volltextzugriff (PDF)

0–1 Knapsack Problems

Paradigms of Combinatorial Optimization, 2013, p.215-242

2013

Volltextzugriff (PDF)

A 0/1 mixed integer linear programming approach to establish an effective preventive maintenance policy for power plant

International journal of industrial and systems engineering, 2017, Vol.25 (4), p.478

2017

Volltextzugriff (PDF)

A 0–1 mixed‐integer program‐based group‐and‐release strategy for solving the integrated runway scheduling and taxiway routing problem

Naval research logistics, 2022-10, Vol.69 (7), p.939-957

2022

Volltextzugriff (PDF)

A 0-1 Model for Solving the Corrugator Trim Problem

Management science, 1983-02, Vol.29 (2), p.200-209

1983

Volltextzugriff (PDF)

0--1 Multiband Robust Optimization

Operations Research Proceedings 2013, 2014, p.89-95

2014

Volltextzugriff (PDF)

0-1 multilinear programming as a unifying theory for LAD pattern generation

Discrete Applied Mathematics, 2017-02, Vol.218, p.21-39

2017

Volltextzugriff (PDF)

0/1 optimization and 0/1 primal separation are equivalent

Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, 2002, p.920-926

2002

Volltextzugriff (PDF)

The 0–1 outcomes feature selection problem: a 2 approach

Journal of intelligent manufacturing, 2004-06, Vol.15 (3), p.329-335

2004

Volltextzugriff (PDF)

0/1 Polytopes with Quadratic Chvátal Rank

Operations research, 2017-01, Vol.65 (1), p.212-220

2017

Volltextzugriff (PDF)

The 0-1 Programming Model for Solving Critical Path and its Sensitivity Analysis

2011 Fourth International Conference on Intelligent Computation Technology and Automation, 2011, Vol.2, p.1019-1022

2011

Volltextzugriff (PDF)

0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization

SIAM journal on optimization, 2012-01, Vol.22 (4), p.1449-1468

2012

Volltextzugriff (PDF)

A 0-1 quadratic programme for the case of missing data in regression

International journal of data analysis techniques and strategies, 2014, Vol.6 (1), p.94

2014

Volltextzugriff (PDF)

0-1 reformulations of the multicommodity capacitated network design problem: Reformulation Techniques and Mathematical Programming

Discrete applied mathematics, 2009, Vol.157 (6), p.1229-1241

2009

Volltextzugriff (PDF)

1 – 25 von 936.773

Menü

Weitere Dienste

Einstellungen

0.05% 20ppm/ C Drift Precision Series Voltage Reference with Shutdown Enable ۝ 5-SOT-23 -40 to 125

0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets

A 0.1–4 GHz SDR receiver with reconfigurable 10–100 MHz signal bandwidth in 65 nm CMOS

A 0-1 AUGMENTED GOAL PROGRAMMING APPROACH TO THE CAPITAL BUDGETING PROBLEM WITH MULTIPLE OBJECTIVES

A 0-1 integer programming approach to a university timetabling problem

0-1 Integer Programming for Generation Maintenance Scheduling in Power Systems Based on Teaching Learning Based Optimization (TLBO)

A 0-1 integer programming model for the simultaneous allocation of operations of part types and grouping of machine-tool combinations

The 0–1 inverse maximum stable set problem

0-1 Knapsack in Nearly Quadratic Time

0/1 Knapsack on Hardware: A Complete Solution

The 0-1 Knapsack Polytope – A Starting Point for Cryptanalysis of Knapsack Ciphers?

0-1 Knapsack Problem Solving using Genetic Optimization Algorithm

0–1 Knapsack Problems

A 0/1 mixed integer linear programming approach to establish an effective preventive maintenance policy for power plant

A 0–1 mixed‐integer program‐based group‐and‐release strategy for solving the integrated runway scheduling and taxiway routing problem

A 0-1 Model for Solving the Corrugator Trim Problem

0--1 Multiband Robust Optimization

0-1 multilinear programming as a unifying theory for LAD pattern generation

0/1 optimization and 0/1 primal separation are equivalent

The 0–1 outcomes feature selection problem: a 2 approach

0/1 Polytopes with Quadratic Chvátal Rank

The 0-1 Programming Model for Solving Critical Path and its Sensitivity Analysis

0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization

A 0-1 quadratic programme for the case of missing data in regression

0-1 reformulations of the multicommodity capacitated network design problem: Reformulation Techniques and Mathematical Programming

Aktive Filter

Suchergebnisse filtern