| Publication | Date of Publication | Type |
|---|
| An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem | 2023-04-24 | Paper |
| Two arc disjoint paths in Eulerian digraphs | 2023-03-21 | Paper |
| A fast and simple algorithm for identifying 2-monotonic positive Boolean functions | 2023-03-21 | Paper |
| Boolean analysis of incomplete examples | 2022-12-09 | Paper |
| A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem | 2022-08-30 | Paper |
| Optimal coteries for rings and related networks | 2020-11-30 | Paper |
| A note on minimizing submodular functions | 2016-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501844 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501852 | 2015-08-14 | Paper |
| An approximation of the minimum vertex cover in a graph | 2015-03-03 | Paper |
| A fast algorithm for cactus representations of minimum cuts | 2015-03-03 | Paper |
| Recent progress of local search in handling the time window constraints of the vehicle routing problem | 2013-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4647970 | 2012-11-08 | Paper |
| An Ejection Chain Approach for the Generalized Assignment Problem | 2012-06-08 | Paper |
| Logical analysis of data: classification with justification | 2011-11-17 | Paper |
| Efficient branch-and-bound algorithms for weighted MAX-2-SAT | 2011-05-11 | Paper |
| Recent progress of local search in handling the time window constraints of the vehicle routing problem | 2010-12-06 | Paper |
| COMPUTING BOUNDS ON RISK-NEUTRAL DISTRIBUTIONS FROM THE OBSERVED PRICES OF CALL OPTIONS | 2010-06-10 | Paper |
| A personal perspective on problem solving by general purpose solvers | 2010-06-08 | Paper |
| Solving the irregular strip packing problem via guided local search for overlap minimization | 2010-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3632444 | 2009-06-11 | Paper |
| Scheduling of corrugated paper production | 2009-04-08 | Paper |
| Translation among CNFs, characteristic models and ordered binary decision diagrams | 2009-03-23 | Paper |
| A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem | 2009-03-23 | Paper |
| Algorithmic Aspects of Graph Connectivity | 2008-12-04 | Paper |
| An iterated local search algorithm for the time-dependent vehicle routing problem with time windows | 2008-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3531028 | 2008-10-21 | Paper |
| An iterated local search algorithm for the vehicle routing problem with convex time penalty functions | 2008-09-10 | Paper |
| A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem | 2007-11-29 | Paper |
| A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route | 2007-11-29 | Paper |
| Duality in option pricing based on prices of other derivatives | 2007-08-27 | Paper |
| The complexity of assigning genotypes to people in a pedigree consistently | 2007-06-26 | Paper |
| Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3426435 | 2007-03-09 | Paper |
| The vehicle routing problem with flexible time windows and traveling times | 2007-01-09 | Paper |
| Minimum edge ranking spanning trees of split graphs | 2007-01-09 | Paper |
| Complexity of identification and dualization of positive Boolean functions | 2006-10-10 | Paper |
| One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming | 2006-09-28 | Paper |
| Augmenting a \((k-1)\)-vertex-connected multigraph to an \(\ell\)-edge-connected and \(k\)-vertex-connected multigraph | 2006-06-14 | Paper |
| A 3-flip neighborhood local search for the set covering problem | 2006-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3368659 | 2006-02-08 | Paper |
| A path relinking approach with ejection chains for the generalized assignment problem | 2005-10-26 | Paper |
| A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem | 2005-08-22 | Paper |
| Lowering eccentricity of a tree by node upgrading | 2005-08-05 | Paper |
| Improved local search algorithms for the rectangle packing problem with general spatial costs | 2005-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461603 | 2005-07-26 | Paper |
| Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships | 2005-06-13 | Paper |
| Greedy splitting algorithms for approximating multiway partition problems | 2005-03-17 | Paper |
| On generalized greedy splitting algorithms for multiway partition problems | 2004-11-23 | Paper |
| Reasoning with ordered binary decision diagrams | 2004-08-19 | Paper |
| A decomposability index in logical analysis of data | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472485 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474092 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474096 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474133 | 2004-08-04 | Paper |
| Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. | 2004-01-05 | Paper |
| Convex embeddings and bisections of 3-connected graphs | 2003-10-14 | Paper |
| Interior and exterior functions of positive Boolean functions. | 2003-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427863 | 2003-09-14 | Paper |
| Local search algorithms for the rectangle packing problem with general spatial costs | 2003-09-01 | Paper |
| Finding essential attributes from binary data | 2003-08-21 | Paper |
| Variations on extending partially defined Boolean functions with missing bits. | 2003-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4408964 | 2003-06-29 | Paper |
| Inferring minimal functional dependencies in Horn and q-Horn theories | 2003-06-09 | Paper |
| One-dimensional cutting stock problem to minimize the number of different patterns | 2003-04-10 | Paper |
| A primal-dual approximation algorithm for the survivable network design problem in hypergraphs | 2003-03-09 | Paper |
| Recognition and dualization of disguised bidual Horn functions. | 2003-01-21 | Paper |
| Logical analysis of data with decomposable structures. | 2003-01-21 | Paper |
| Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation | 2002-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536430 | 2002-11-25 | Paper |
| Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem | 2002-09-30 | Paper |
| Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks | 2002-09-29 | Paper |
| Graph connectivity and its augmentation: Applications of MA orderings | 2002-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548331 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548337 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548783 | 2002-08-26 | Paper |
| A tabu search approach to the constraint satisfaction problem as a general problem solver | 2002-08-18 | Paper |
| Logical analysis of binary data with missing bits | 2002-07-24 | Paper |
| Computing intersections of Horn theories for reasoning with models | 2002-07-24 | Paper |
| On functional dependencies in \(q\)-Horn theories | 2002-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766849 | 2002-07-22 | Paper |
| Ordered binary decision diagrams as knowledge-bases | 2002-07-15 | Paper |
| Disjunctions of Horn Theories and Their Cores | 2002-04-23 | Paper |
| Decision lists and related Boolean functions | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762526 | 2002-01-09 | Paper |
| Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts | 2002-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2776575 | 2002-01-01 | Paper |
| Multigraph augmentation under biconnectivity and general edge-connectivity requirements | 2001-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511243 | 2001-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753937 | 2001-11-11 | Paper |
| On the difference of Horn theories | 2001-10-30 | Paper |
| Augmenting a submodular and posi-modular set function by a multigraph | 2001-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743798 | 2001-09-17 | Paper |
| On Minimum Edge Ranking Spanning Trees | 2001-07-23 | Paper |
| Totally balanced combinatorial optimization games | 2001-06-10 | Paper |
| Analyses on the 2 and 3-flip neighborhoods for the MAX SAT | 2001-03-04 | Paper |
| A fast algorithm for computing minimum 3-way and 4-way cuts | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761945 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761947 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761950 | 2001-02-21 | Paper |
| Polyhedral structure of submodular and posi-modular systems | 2001-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525700 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525718 | 2001-01-24 | Paper |
| Optimal augmentation of a 2-vertex-connected multigraph to an \(\ell\)-edge-connected and 3-vertex-connected multigraph | 2001-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511219 | 2000-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511240 | 2000-10-30 | Paper |
| A faster algorithm for computing minimum 5-way and 6-way cuts in graphs | 2000-10-30 | Paper |
| A variable depth search algorithm with branching search for the generalized assignment problem | 2000-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247449 | 2000-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505388 | 2000-09-27 | Paper |
| Optimal scheduling in parallel and serial manufacturing systems via the maximum principle | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4949151 | 2000-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4494938 | 2000-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495204 | 2000-08-10 | Paper |
| Boolean Normal Forms, Shellability, and Reliability Computations | 2000-07-20 | Paper |
| Algorithmic Aspects of the Core of Combinatorial Optimization Games | 2000-07-19 | Paper |
| A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs | 2000-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938784 | 2000-03-27 | Paper |
| Minimum self-dual decompositions of positive dual-minor Boolean functions | 2000-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938657 | 2000-02-23 | Paper |
| A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937126 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937128 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937141 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937169 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937177 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937178 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937207 | 2000-02-03 | Paper |
| Bidual Horn functions and extensions | 2000-01-17 | Paper |
| Inner-core and outer-core functions of partially defined Boolean functions | 2000-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705030 | 1999-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703145 | 1999-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703154 | 1999-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703853 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703856 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253477 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253478 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251064 | 1999-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268432 | 1999-10-31 | Paper |
| Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time | 1999-10-28 | Paper |
| Horn Extensions of a Partially Defined Boolean Function | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263725 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249522 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249524 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249525 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250193 | 1999-06-17 | Paper |
| Double-offer arbitration | 1999-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228455 | 1999-05-18 | Paper |
| Double Horn functions | 1999-05-16 | Paper |
| Functional dependencies in Horn theories | 1999-04-28 | Paper |
| A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons | 1999-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370202 | 1998-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218412 | 1998-11-11 | Paper |
| The use of dynamic programming in genetic algorithms for permutation problems | 1998-10-18 | Paper |
| Two Arc-Disjoint Paths in Eulerian Digraphs | 1998-09-21 | Paper |
| Complexity Of The Single Vehicle Scheduling Problem On Graphs | 1998-09-07 | Paper |
| Error-free and best-fit extensions of partially defined Boolean functions | 1998-07-27 | Paper |
| A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions | 1998-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370222 | 1998-05-25 | Paper |
| Deterministic \(\tilde O(nm)\) time edge-splitting in undirected graphs | 1998-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370203 | 1998-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381405 | 1998-04-01 | Paper |
| The Maximum Latency and Identification of Positive Boolean Functions | 1998-02-10 | Paper |
| Computing All Small Cuts in an Undirected Network | 1998-02-09 | Paper |
| Searching minimax game trees under memory space constraint | 1997-12-14 | Paper |
| VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS | 1997-10-30 | Paper |
| Positive and Horn decomposability of partially defined Boolean functions | 1997-10-29 | Paper |
| Complexity of the Minimum Base Game on Matroids | 1997-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4350037 | 1997-08-28 | Paper |
| Logical analysis of numerical data | 1997-08-28 | Paper |
| Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle | 1997-08-03 | Paper |
| Hitting or avoiding balls in Euclidean space | 1997-06-16 | Paper |
| Vehicle scheduling on a tree with release and handling times | 1997-06-16 | Paper |
| Interior and exterior functions of Boolean functions | 1997-01-27 | Paper |
| A multisplitting method for symmetric linear complementarity problems | 1997-01-05 | Paper |
| Decompositions of positive self-dual Boolean functions | 1996-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4870838 | 1996-03-26 | Paper |
| Decomposability of partially defined Boolean functions | 1996-03-11 | Paper |
| A parallel relaxation method for quadratic programming problems with interval constraints | 1996-02-18 | Paper |
| Implementing an efficient minimum capacity cut algorithm | 1995-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4834032 | 1995-05-23 | Paper |
| A dynamic programming method for single machine scheduling | 1994-08-21 | Paper |
| A SUCCESSIVE OVER-RELAXATION METHOD FOR QUADRATIC PROGRAMMING PROBLEMS WITH INTERVAL CONSTRAINTS | 1994-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4286721 | 1994-04-04 | Paper |
| A PRACTICAL APPROACH TO DECOMPOSABLE NONLINEAR PROGRAMMING PROBLEMS | 1993-08-25 | Paper |
| On sparse subgraphs preserving connectivity properties | 1993-08-24 | Paper |
| A globally convergent Newton method for solving strongly monotone variational inequalities | 1993-08-17 | Paper |
| A multiversion cautious scheduler with dynamic serialization constraints for database concurrency control | 1993-05-16 | Paper |
| An optimal backup policy for a hard computer disk depending on age under availability criterion | 1993-04-01 | Paper |
| Optimal minimal-repair and replacement problem with age dependent cost structure | 1993-04-01 | Paper |
| Primal-dual proximal point algorithm for linearly constrained convex programming problems | 1993-02-04 | Paper |
| On the average optimality of circular assignment policy | 1993-01-17 | Paper |
| On Onaga's upper bound on the mean values of probabilistic maximum flows | 1993-01-16 | Paper |
| A linear time algorithm for computing 3-edge-connected components in a multigraph | 1993-01-16 | Paper |
| DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS | 1992-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3993069 | 1992-09-17 | Paper |
| Counting the number of minimum cuts in undirected multigraphs | 1992-06-28 | Paper |
| Computing Edge-Connectivity in Multigraphs and Capacitated Graphs | 1992-06-28 | Paper |
| Successive linearization methods for large-scale nonlinear programming problems | 1992-06-28 | Paper |
| Optimal strategies for some team games | 1992-06-28 | Paper |
| A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph | 1992-06-28 | Paper |
| Maximum flows in probabilistic networks | 1992-06-27 | Paper |
| An algorithm for the fair resource allocation problem with a submodular constraint | 1992-06-27 | Paper |
| Chain packing in graphs | 1991-01-01 | Paper |
| Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices | 1990-01-01 | Paper |
| Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities | 1990-01-01 | Paper |
| Multicommodity flows in certain planar directed networks | 1990-01-01 | Paper |
| An Efficient Trust Region Algorithm for Minimizing Nondifferentiable Composite Functions | 1989-01-01 | Paper |
| INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS | 1989-01-01 | Paper |
| On max-flow min-cut and integral flow properties for multicommodity flows in directed networks | 1989-01-01 | Paper |
| On generalized pseudoconvex functions | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3491589 | 1988-01-01 | Paper |
| AN ITERATIVE METHOD FOR VARIATIONAL INEQUALITIES WITH APPLICATION TO TRAFFIC EQUILIBRIUM PROBLEMS | 1988-01-01 | Paper |
| A comparative study of several semi-infinite nonlinear programming algorithms | 1988-01-01 | Paper |
| A globally convergent SQP method for semi-infinite nonlinear optimization | 1988-01-01 | Paper |
| Approximation algorithms for combinatorial fractional programming problems | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3786029 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3788955 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798199 | 1987-01-01 | Paper |
| A cautious scheduler for multistep transactions | 1987-01-01 | Paper |
| A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program | 1987-01-01 | Paper |
| A generalization of alpha-beta and \(SSS^*\) search procedures | 1986-01-01 | Paper |
| Distances defined by neighborhood sequences | 1986-01-01 | Paper |
| Strong unimodularity for matrices and hypergraphs | 1986-01-01 | Paper |
| An Algorithm for the Equipollent Resource Allocation Problem | 1985-01-01 | Paper |
| Cautious transaction schedulers with admission control | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3734164 | 1985-01-01 | Paper |
| An efficient algorithm for the parametric resource allocation problem | 1985-01-01 | Paper |
| Parametric approaches to fractional programs | 1983-01-01 | Paper |
| Fractional programming | 1983-01-01 | Paper |
| Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem | 1983-01-01 | Paper |
| Design of Minimum-Cost Deadlock-Free Systems | 1983-01-01 | Paper |
| On-line computation of transitive closures of graphs | 1983-01-01 | Paper |
| A polynomial time algorithm for a chance-constrained single machine scheduling problem | 1983-01-01 | Paper |
| Bin packing and multiprocessor scheduling problems with side constraint on job types | 1983-01-01 | Paper |
| THE POWER OF UPPER AND LOWER BOUNDING FUNCTIONS IN BRANCH-AND-BOUND ALGORITHMS | 1982-01-01 | Paper |
| Deadlock-Free Systems for a Bounded Number of Processes | 1982-01-01 | Paper |
| An efficient algorithm for K shortest simple paths | 1982-01-01 | Paper |
| Threshold Numbers and Threshold Completions | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3318566 | 1981-01-01 | Paper |
| On Minimal Test Sets for Locating Single Link Failures in Networks | 1981-01-01 | Paper |
| An Algorithm for Finding K Minimum Spanning Trees | 1981-01-01 | Paper |
| An Algorithm for the K Best Solutions of the Resource Allocation Problem | 1981-01-01 | Paper |
| Sufficient Conditions for Graphs to Have Threshold Number 2 | 1981-01-01 | Paper |
| Threshold Sequences | 1981-01-01 | Paper |
| Threshold Numbers and Threshold Completions | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3863429 | 1980-01-01 | Paper |
| APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS | 1980-01-01 | Paper |
| Notes on the Problem of the Allocation of Resources to Activities in Discrete Quantities | 1980-01-01 | Paper |
| The number of additional variables required for the integer programming formulation | 1980-01-01 | Paper |
| PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES | 1979-01-01 | Paper |
| ALGORITHMS FOR A VARIANT OF THE RESOURCE ALLOCATION PROBLEM | 1979-01-01 | Paper |
| A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3207000 | 1978-01-01 | Paper |
| Branch-and-bound procedure and state—space representation of combinatorial optimization problems | 1978-01-01 | Paper |
| A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times | 1978-01-01 | Paper |
| THE MULTIPLE-CHOICE KNAPSACK PROBLEM | 1978-01-01 | Paper |
| Finite automata having cost functions: Nondeterministic models | 1978-01-01 | Paper |
| Depth-m search in branch-and-bound algorithms | 1978-01-01 | Paper |
| The Power of Dominance Relations in Branch-and-Bound Algorithms | 1977-01-01 | Paper |
| ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS | 1977-01-01 | Paper |
| Fractional knapsack problems | 1977-01-01 | Paper |
| Finite automata having cost functions | 1976-01-01 | Paper |
| AN ASSIGNMENT PROBLEM ON A NETWORK | 1976-01-01 | Paper |
| ALGORITHMS FOR QUADRATIC FRACTIONAL PROGRAMMING PROBLEMS | 1976-01-01 | Paper |
| Computational Efficiency of Approximate Branch-and-Bound Algorithms | 1976-01-01 | Paper |
| A PRIMAL CUTTING PLANE ALGORITHM FOR INTEGER FRACTIONAL PROGRAMMING PROBLEMS | 1976-01-01 | Paper |
| Theoretical comparisons of search strategies in branch-and-bound algorithms | 1976-01-01 | Paper |
| On the optimality of algorithms for finite state sequential decision processes | 1976-01-01 | Paper |
| Integer programming formulation of combinatorial optimization problems | 1976-01-01 | Paper |
| Minimal representations of some classes of dynamic programming | 1975-01-01 | Paper |
| Comments on "Monotone Functions in Sequential Circuits" | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4124605 | 1974-01-01 | Paper |
| Classes of discrete optimization problems and their decision problems | 1974-01-01 | Paper |
| Finite State Representations of Discrete Optimization Problems | 1973-01-01 | Paper |
| Technical Note—The Use of Cuts in Complementary Programming | 1973-01-01 | Paper |
| Fail-safe realization of sequential machines | 1973-01-01 | Paper |
| Algorithms for Obtaining Shortest Paths Visiting Specified Nodes | 1973-01-01 | Paper |
| Solvable classes of discrete dynamic programming | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5639305 | 1972-01-01 | Paper |
| Design of Optimal Switching Networks by Integer Programming | 1972-01-01 | Paper |
| N-Fail-Safe Sequential Machines | 1972-01-01 | Paper |
| Representation theorems for equivalent optimization problems | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5661329 | 1972-01-01 | Paper |
| Synthesis of Networks with a Minimum Number of Negative Gates | 1971-01-01 | Paper |
| Technical Note—Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks | 1971-01-01 | Paper |
| Gate-Interconnection Minimization of Switching Networks Using Negative Gates | 1971-01-01 | Paper |
| Technical Note—Complementary Programming | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5650210 | 1971-01-01 | Paper |
| Adaptive Linear Classifier by Linear Programming | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5595900 | 1969-01-01 | Paper |
| Realization of Arbitrary Logic Functions by Completely Monotonic Functions and Its Applications to Threshold Logic | 1968-01-01 | Paper |
| On Autonomous Logic Nets of Threshold Elements | 1968-01-01 | Paper |
| A Theory of Completely Monotonic Functions and its Applications to Threshold Logic | 1968-01-01 | Paper |
| A Lower Bound of the Number of Threshold Functions | 1965-01-01 | Paper |
