| Publication | Date of Publication | Type |
|---|
| An extreme‐point tabu‐search algorithm for fixed‐charge network problems | 2023-12-11 | Paper |
| Applications and Computational Advances for Solving the QUBO Model | 2022-11-15 | Paper |
| QUBO Software | 2022-11-15 | Paper |
| Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange | 2022-08-01 | Paper |
| Quantum bridge analytics. I: A tutorial on formulating and using QUBO models | 2022-08-01 | Paper |
| Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange | 2021-05-20 | Paper |
| Quantum bridge analytics. I: A tutorial on formulating and using QUBO models | 2020-01-13 | Paper |
| Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems | 2017-11-23 | Paper |
| Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem | 2017-05-31 | Paper |
| Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs | 2016-07-06 | Paper |
| Exact solutions to generalized vertex covering problems: a comparison of two models | 2015-10-06 | Paper |
| Polynomial unconstrained binary optimisation -- part 1 | 2015-02-23 | Paper |
| Polynomial unconstrained binary optimisation -- part 2 | 2015-02-23 | Paper |
| The unconstrained binary quadratic programming problem: a survey | 2014-09-05 | Paper |
| A computational study on the quadratic knapsack problem with multiple constraints | 2012-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3088464 | 2011-08-19 | Paper |
| A two-stage approach to solving large capacitated task allocation problems | 2010-12-27 | Paper |
| A note on optimal solutions to quadratic knapsack problems | 2010-12-27 | Paper |
| Solving the market split problem via branch-and-cut | 2010-01-26 | Paper |
| Computationally attractive nonlinear models for combinatorial optimisation | 2009-10-12 | Paper |
| A note on xQx as a modelling and solution framework for the linear ordering problem | 2009-09-13 | Paper |
| Simple and fast surrogate constraint heuristics for the maximum independent set problem | 2009-03-31 | Paper |
| SIMULATION OPTIMIZATION: APPLICATIONS IN RISK MANAGEMENT | 2009-02-10 | Paper |
| A new modeling and solution approach for the number partitioning problem | 2008-07-01 | Paper |
| Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis | 2008-03-18 | Paper |
| A new approach for modeling and solving set packing problems | 2007-11-23 | Paper |
| An effective modeling and solution approach for the generalized independent set problem | 2007-11-05 | Paper |
| A new modeling and solution approach for the set-partitioning problem | 2007-10-19 | Paper |
| Solving the maximum edge weight clique problem via unconstrained quadratic programming | 2007-04-19 | Paper |
| Solving group technology problems via clique partitioning | 2007-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5393829 | 2006-10-24 | Paper |
| Using the unconstrained quadratic program to model and solve Max 2-SAT problems | 2006-10-04 | Paper |
| An unconstrained quadratic binary programming approach to the vertex coloring problem | 2006-03-07 | Paper |
| Clustering of microarray data via clique partitioning | 2005-12-13 | Paper |
| Using \(xQx\) to model and solve the uncapacitated task allocation problem | 2005-08-25 | Paper |
| A unified modeling and solution framework for combinatorial optimization problems | 2004-09-22 | Paper |
| One-pass heuristics for large-scale unconstrained binary quadratic problems | 2002-06-16 | Paper |
| Adaptive Memory Tabu Search for Binary Quadratic Programs | 2002-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4550768 | 2002-01-01 | Paper |
| Greedy solutions of selection and ordering problems | 2001-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495174 | 2000-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4350063 | 1997-12-11 | Paper |
| Minimization of Total Absolute Flow Time Deviation in Single and Multiple Machine Scheduling | 1995-02-13 | Paper |
| 0-1 Quadratic programming approach for optimum solutions of two scheduling problems | 1994-09-14 | Paper |
| Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems | 1988-01-01 | Paper |
| Aggregating assignment constraints | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4744075 | 1983-01-01 | Paper |
| A simple, all primal branch and bound approach to pure and mixed integer binary programs | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3946693 | 1982-01-01 | Paper |
| Computing inter-site distances for routing and scheduling problems | 1981-01-01 | Paper |
| Constrained Entropy Models; Solvability and Sensitivity | 1979-01-01 | Paper |
| Some remarks on condensation methods for geometric programs | 1979-01-01 | Paper |
| Technical Note—An Implementation of Surrogate Constraint Duality | 1978-01-01 | Paper |
| Sensitivity Analysis Procedures for Geometric Programs: Computational Aspects | 1978-01-01 | Paper |
| An implementation of some implicit function theorems with applications to sensitivity analysis | 1978-01-01 | Paper |
| A linear programming approach to geometric programs | 1978-01-01 | Paper |
| Computational aspects of cutting-plane algorithms for geometric programming problems | 1977-01-01 | Paper |
| Technical Note—On Sensitivity Analysis in Geometric Programming | 1977-01-01 | Paper |
| A computational study of methods for solving polynomial geometric programs | 1976-01-01 | Paper |
| Maximization of linearly constrained posynomials | 1976-01-01 | Paper |
| Discrete solutions to engineering design problems | 1975-01-01 | Paper |
| Note—A Note on “Substitution Effects in Geometric Programming” | 1974-01-01 | Paper |
| On “a cofferdam design optimization” | 1974-01-01 | Paper |
| An approach to the numerical solutions of geometric programs | 1974-01-01 | Paper |
| On the Solution of Geometric Programs via Separable Programming | 1973-01-01 | Paper |
