| Publication | Date of Publication | Type |
|---|
An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem
INFOR: Information Systems and Operational Research | 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
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
Optimal coteries for rings and related networks
Distributed Computing | 2020-11-30 | Paper |
A note on minimizing submodular functions
Information Processing Letters | 2016-06-09 | Paper |
| scientific article; zbMATH DE number 6472650 (Why is no real title available?) | 2015-08-14 | Paper |
| scientific article; zbMATH DE number 6472642 (Why is no real title available?) | 2015-08-14 | Paper |
An approximation of the minimum vertex cover in a graph
Japan Journal of Industrial and Applied Mathematics | 2015-03-03 | Paper |
A fast algorithm for cactus representations of minimum cuts
Japan Journal of Industrial and Applied Mathematics | 2015-03-03 | Paper |
Recent progress of local search in handling the time window constraints of the vehicle routing problem
Annals of Operations Research | 2013-08-08 | Paper |
| On the maximization and minimization of a quasiconvex function | 2012-11-08 | Paper |
An ejection chain approach for the generalized assignment problem
INFORMS Journal on Computing | 2012-06-08 | Paper |
Logical analysis of data: classification with justification
Annals of Operations Research | 2011-11-17 | Paper |
Efficient branch-and-bound algorithms for weighted MAX-2-SAT
Mathematical Programming. Series A. Series B | 2011-05-11 | Paper |
Recent progress of local search in handling the time window constraints of the vehicle routing problem
4OR | 2010-12-06 | Paper |
COMPUTING BOUNDS ON RISK-NEUTRAL DISTRIBUTIONS FROM THE OBSERVED PRICES OF CALL OPTIONS
Asia-Pacific Journal of Operational Research | 2010-06-10 | Paper |
A personal perspective on problem solving by general purpose solvers
International Transactions in Operational Research | 2010-06-08 | Paper |
Solving the irregular strip packing problem via guided local search for overlap minimization
International Transactions in Operational Research | 2010-01-29 | Paper |
| A set covering approach for the pickup and delivery problem with general constraints on each route | 2009-06-11 | Paper |
Scheduling of corrugated paper production
European Journal of Operational Research | 2009-04-08 | Paper |
A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem
Information Processing Letters | 2009-03-23 | Paper |
Translation among CNFs, characteristic models and ordered binary decision diagrams
Information Processing Letters | 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
Discrete Optimization | 2008-10-29 | Paper |
| scientific article; zbMATH DE number 5355239 (Why is no real title available?) | 2008-10-21 | Paper |
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
Discrete Applied Mathematics | 2008-09-10 | Paper |
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem
Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics | 2007-11-29 | Paper |
A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route
Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics | 2007-11-29 | Paper |
Duality in option pricing based on prices of other derivatives
Operations Research Letters | 2007-08-27 | Paper |
The complexity of assigning genotypes to people in a pedigree consistently
Discrete Mathematics | 2007-06-26 | Paper |
Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
| A metaheuristic approach to the resource constrained project scheduling with variable activity durations and convex cost functions | 2007-03-09 | Paper |
Minimum edge ranking spanning trees of split graphs
Discrete Applied Mathematics | 2007-01-09 | Paper |
The vehicle routing problem with flexible time windows and traveling times
Discrete Applied Mathematics | 2007-01-09 | Paper |
Complexity of identification and dualization of positive Boolean functions
Information and Computation | 2006-10-10 | Paper |
One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
JMMA. Journal of Mathematical Modelling and Algorithms | 2006-09-28 | Paper |
Augmenting a \((k-1)\)-vertex-connected multigraph to an \(\ell\)-edge-connected and \(k\)-vertex-connected multigraph
Algorithmica | 2006-06-14 | Paper |
A 3-flip neighborhood local search for the set covering problem
European Journal of Operational Research | 2006-04-28 | Paper |
| Heuristic approaches to the capacitated square covering problem | 2006-02-08 | Paper |
A path relinking approach with ejection chains for the generalized assignment problem
European Journal of Operational Research | 2005-10-26 | Paper |
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
Discrete Optimization | 2005-08-22 | Paper |
Lowering eccentricity of a tree by node upgrading
Networks | 2005-08-05 | Paper |
Improved local search algorithms for the rectangle packing problem with general spatial costs
European Journal of Operational Research | 2005-08-01 | Paper |
| scientific article; zbMATH DE number 2188496 (Why is no real title available?) | 2005-07-26 | Paper |
Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships
Journal of Global Optimization | 2005-06-13 | Paper |
Greedy splitting algorithms for approximating multiway partition problems
Mathematical Programming. Series A. Series B | 2005-03-17 | Paper |
On generalized greedy splitting algorithms for multiway partition problems
Discrete Applied Mathematics | 2004-11-23 | Paper |
Reasoning with ordered binary decision diagrams
Discrete Applied Mathematics | 2004-08-19 | Paper |
A decomposability index in logical analysis of data
Discrete Applied Mathematics | 2004-08-19 | Paper |
| scientific article; zbMATH DE number 2080240 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080994 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081031 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080998 (Why is no real title available?) | 2004-08-04 | Paper |
Average running time analysis of an algorithm to calculate the size of the union of Cartesian products.
Discrete Mathematics | 2004-01-05 | Paper |
Convex embeddings and bisections of 3-connected graphs
Combinatorica | 2003-10-14 | Paper |
Interior and exterior functions of positive Boolean functions.
Discrete Applied Mathematics | 2003-09-22 | Paper |
| scientific article; zbMATH DE number 1979519 (Why is no real title available?) | 2003-09-14 | Paper |
Local search algorithms for the rectangle packing problem with general spatial costs
Mathematical Programming. Series A. Series B | 2003-09-01 | Paper |
Finding essential attributes from binary data
Annals of Mathematics and Artificial Intelligence | 2003-08-21 | Paper |
Variations on extending partially defined Boolean functions with missing bits.
Information and Computation | 2003-08-13 | Paper |
| scientific article; zbMATH DE number 1941908 (Why is no real title available?) | 2003-06-29 | Paper |
Inferring minimal functional dependencies in Horn and q-Horn theories
Annals of Mathematics and Artificial Intelligence | 2003-06-09 | Paper |
One-dimensional cutting stock problem to minimize the number of different patterns
European Journal of Operational Research | 2003-04-10 | Paper |
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
Discrete Applied Mathematics | 2003-03-09 | Paper |
Recognition and dualization of disguised bidual Horn functions.
Information Processing Letters | 2003-01-21 | Paper |
Logical analysis of data with decomposable structures.
Theoretical Computer Science | 2003-01-21 | Paper |
Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation
Journal of Heuristics | 2002-12-15 | Paper |
| scientific article; zbMATH DE number 1759476 (Why is no real title available?) | 2002-11-25 | Paper |
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
Journal of Algorithms | 2002-09-30 | Paper |
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
Networks | 2002-09-29 | Paper |
Graph connectivity and its augmentation: Applications of MA orderings
Discrete Applied Mathematics | 2002-09-17 | Paper |
| scientific article; zbMATH DE number 1788731 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1788735 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1789187 (Why is no real title available?) | 2002-08-26 | Paper |
A tabu search approach to the constraint satisfaction problem as a general problem solver
European Journal of Operational Research | 2002-08-18 | Paper |
Logical analysis of binary data with missing bits
Artificial Intelligence | 2002-07-24 | Paper |
Computing intersections of Horn theories for reasoning with models
Artificial Intelligence | 2002-07-24 | Paper |
On functional dependencies in q-Horn theories
Artificial Intelligence | 2002-07-24 | Paper |
| scientific article; zbMATH DE number 1696655 (Why is no real title available?) | 2002-07-22 | Paper |
Ordered binary decision diagrams as knowledge-bases
Artificial Intelligence | 2002-07-15 | Paper |
Disjunctions of Horn theories and their cores
SIAM Journal on Computing | 2002-04-23 | Paper |
Decision lists and related Boolean functions
Theoretical Computer Science | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1688385 (Why is no real title available?) | 2002-01-09 | Paper |
Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
Journal of Combinatorial Optimization | 2002-01-08 | Paper |
| Formulation and tabu search algorithm for the resource constrained project scheduling problem. | 2002-01-01 | Paper |
Multigraph augmentation under biconnectivity and general edge-connectivity requirements
Networks | 2001-12-19 | Paper |
| scientific article; zbMATH DE number 1522947 (Why is no real title available?) | 2001-11-28 | Paper |
| scientific article; zbMATH DE number 1670660 (Why is no real title available?) | 2001-11-11 | Paper |
On the difference of Horn theories
Journal of Computer and System Sciences | 2001-10-30 | Paper |
Augmenting a submodular and posi-modular set function by a multigraph
Journal of Combinatorial Optimization | 2001-09-19 | Paper |
Deduction and abduction with ordered binary decision diagrams
RIMS Kokyuroku | 2001-09-17 | Paper |
On minimum edge ranking spanning trees
Journal of Algorithms | 2001-07-23 | Paper |
Totally balanced combinatorial optimization games
Mathematical Programming. Series A. Series B | 2001-06-10 | Paper |
Analyses on the 2 and 3-flip neighborhoods for the MAX SAT
Journal of Combinatorial Optimization | 2001-03-04 | Paper |
A fast algorithm for computing minimum 3-way and 4-way cuts
Mathematical Programming. Series A. Series B | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1568135 (Why is no real title available?) | 2001-02-21 | Paper |
| scientific article; zbMATH DE number 1568137 (Why is no real title available?) | 2001-02-21 | Paper |
| scientific article; zbMATH DE number 1568139 (Why is no real title available?) | 2001-02-21 | Paper |
Polyhedral structure of submodular and posi-modular systems
Discrete Applied Mathematics | 2001-02-18 | Paper |
| scientific article; zbMATH DE number 1555949 (Why is no real title available?) | 2001-01-24 | Paper |
| scientific article; zbMATH DE number 1555934 (Why is no real title available?) | 2001-01-24 | Paper |
Optimal augmentation of a 2-vertex-connected multigraph to an \(\ell\)-edge-connected and 3-vertex-connected multigraph
Journal of Combinatorial Optimization | 2001-01-14 | Paper |
| scientific article; zbMATH DE number 1522923 (Why is no real title available?) | 2000-10-30 | Paper |
| scientific article; zbMATH DE number 1522944 (Why is no real title available?) | 2000-10-30 | Paper |
A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
Journal of Combinatorial Optimization | 2000-10-30 | Paper |
A variable depth search algorithm with branching search for the generalized assignment problem
Optimization Methods & Software | 2000-10-29 | Paper |
| scientific article; zbMATH DE number 1302182 (Why is no real title available?) | 2000-10-10 | Paper |
| scientific article; zbMATH DE number 1511702 (Why is no real title available?) | 2000-09-27 | Paper |
Optimal scheduling in parallel and serial manufacturing systems via the maximum principle
Journal of Global Optimization | 2000-09-14 | Paper |
| scientific article; zbMATH DE number 1436990 (Why is no real title available?) | 2000-08-23 | Paper |
| scientific article; zbMATH DE number 1486639 (Why is no real title available?) | 2000-08-20 | Paper |
| scientific article; zbMATH DE number 1488098 (Why is no real title available?) | 2000-08-10 | Paper |
Boolean Normal Forms, Shellability, and Reliability Computations
SIAM Journal on Discrete Mathematics | 2000-07-20 | Paper |
Algorithmic Aspects of the Core of Combinatorial Optimization Games
Mathematics of Operations Research | 2000-07-19 | Paper |
A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs
Algorithmica | 2000-07-19 | Paper |
| scientific article; zbMATH DE number 1405799 (Why is no real title available?) | 2000-03-27 | Paper |
Minimum self-dual decompositions of positive dual-minor Boolean functions
Discrete Applied Mathematics | 2000-03-02 | Paper |
| scientific article; zbMATH DE number 1405676 (Why is no real title available?) | 2000-02-23 | Paper |
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs
Lecture Notes in Computer Science | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 1398013 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1398015 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1398028 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1398053 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1398061 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1398062 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1398086 (Why is no real title available?) | 2000-02-03 | Paper |
Bidual Horn functions and extensions
Discrete Applied Mathematics | 2000-01-17 | Paper |
Inner-core and outer-core functions of partially defined Boolean functions
Discrete Applied Mathematics | 2000-01-17 | Paper |
| scientific article; zbMATH DE number 1379520 (Why is no real title available?) | 1999-12-15 | Paper |
| scientific article; zbMATH DE number 1377714 (Why is no real title available?) | 1999-12-14 | Paper |
| scientific article; zbMATH DE number 1377723 (Why is no real title available?) | 1999-12-14 | Paper |
| scientific article; zbMATH DE number 1372654 (Why is no real title available?) | 1999-12-01 | Paper |
| scientific article; zbMATH DE number 1372651 (Why is no real title available?) | 1999-12-01 | Paper |
| scientific article; zbMATH DE number 1322437 (Why is no real title available?) | 1999-11-08 | Paper |
| scientific article; zbMATH DE number 1322438 (Why is no real title available?) | 1999-11-08 | Paper |
| scientific article; zbMATH DE number 1304333 (Why is no real title available?) | 1999-11-07 | Paper |
| scientific article; zbMATH DE number 1354119 (Why is no real title available?) | 1999-10-31 | Paper |
Horn Extensions of a Partially Defined Boolean Function
SIAM Journal on Computing | 1999-10-28 | Paper |
Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time
Journal of Algorithms | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1342143 (Why is no real title available?) | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1303025 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1303026 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1303567 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1303023 (Why is no real title available?) | 1999-06-17 | Paper |
Double-offer arbitration
Mathematical Social Sciences | 1999-05-26 | Paper |
| scientific article; zbMATH DE number 1256720 (Why is no real title available?) | 1999-05-18 | Paper |
Double Horn functions
Information and Computation | 1999-05-16 | Paper |
Functional dependencies in Horn theories
Artificial Intelligence | 1999-04-28 | Paper |
A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons
Combinatorica | 1999-03-14 | Paper |
| scientific article; zbMATH DE number 1104329 (Why is no real title available?) | 1998-12-02 | Paper |
| scientific article; zbMATH DE number 1222824 (Why is no real title available?) | 1998-11-11 | Paper |
The use of dynamic programming in genetic algorithms for permutation problems
European Journal of Operational Research | 1998-10-18 | Paper |
Two Arc-Disjoint Paths in Eulerian Digraphs
SIAM Journal on Discrete Mathematics | 1998-09-21 | Paper |
Complexity Of The Single Vehicle Scheduling Problem On Graphs
INFOR: Information Systems and Operational Research | 1998-09-07 | Paper |
Error-free and best-fit extensions of partially defined Boolean functions
Information and Computation | 1998-07-27 | Paper |
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions
Journal of Algorithms | 1998-06-23 | Paper |
| scientific article; zbMATH DE number 1104349 (Why is no real title available?) | 1998-05-25 | Paper |
Deterministic O(nm) time edge-splitting in undirected graphs
Journal of Combinatorial Optimization | 1998-04-13 | Paper |
| scientific article; zbMATH DE number 1104330 (Why is no real title available?) | 1998-04-01 | Paper |
| scientific article; zbMATH DE number 1136094 (Why is no real title available?) | 1998-04-01 | Paper |
The Maximum Latency and Identification of Positive Boolean Functions
SIAM Journal on Computing | 1998-02-10 | Paper |
Computing All Small Cuts in an Undirected Network
SIAM Journal on Discrete Mathematics | 1998-02-09 | Paper |
Searching minimax game trees under memory space constraint
Annals of Mathematics and Artificial Intelligence | 1997-12-14 | Paper |
VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS
Journal of the Operations Research Society of Japan | 1997-10-30 | Paper |
Positive and Horn decomposability of partially defined Boolean functions
Discrete Applied Mathematics | 1997-10-29 | Paper |
Complexity of the Minimum Base Game on Matroids
Mathematics of Operations Research | 1997-10-05 | Paper |
| scientific article; zbMATH DE number 1054928 (Why is no real title available?) | 1997-08-28 | Paper |
Logical analysis of numerical data
Mathematical Programming. Series A. Series B | 1997-08-28 | Paper |
Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
SIAM Journal on Computing | 1997-08-03 | Paper |
Vehicle scheduling on a tree with release and handling times
Annals of Operations Research | 1997-06-16 | Paper |
Hitting or avoiding balls in Euclidean space
Annals of Operations Research | 1997-06-16 | Paper |
Interior and exterior functions of Boolean functions
Discrete Applied Mathematics | 1997-01-27 | Paper |
A multisplitting method for symmetric linear complementarity problems
Journal of Computational and Applied Mathematics | 1997-01-05 | Paper |
Decompositions of positive self-dual Boolean functions
Discrete Mathematics | 1996-06-24 | Paper |
| scientific article; zbMATH DE number 860065 (Why is no real title available?) | 1996-03-26 | Paper |
Decomposability of partially defined Boolean functions
Discrete Applied Mathematics | 1996-03-11 | Paper |
A parallel relaxation method for quadratic programming problems with interval constraints
Journal of Computational and Applied Mathematics | 1996-02-18 | Paper |
Implementing an efficient minimum capacity cut algorithm
Mathematical Programming. Series A. Series B | 1995-09-27 | Paper |
| scientific article; zbMATH DE number 758127 (Why is no real title available?) | 1995-05-23 | Paper |
A dynamic programming method for single machine scheduling
European Journal of Operational Research | 1994-08-21 | Paper |
A SUCCESSIVE OVER-RELAXATION METHOD FOR QUADRATIC PROGRAMMING PROBLEMS WITH INTERVAL CONSTRAINTS
Journal of the Operations Research Society of Japan | 1994-04-26 | Paper |
| scientific article; zbMATH DE number 544186 (Why is no real title available?) | 1994-04-04 | Paper |
A PRACTICAL APPROACH TO DECOMPOSABLE NONLINEAR PROGRAMMING PROBLEMS
Journal of the Operations Research Society of Japan | 1993-08-25 | Paper |
On sparse subgraphs preserving connectivity properties
Journal of Graph Theory | 1993-08-24 | Paper |
A globally convergent Newton method for solving strongly monotone variational inequalities
Mathematical Programming. Series A. Series B | 1993-08-17 | Paper |
A multiversion cautious scheduler with dynamic serialization constraints for database concurrency control
Discrete Applied Mathematics | 1993-05-16 | Paper |
An optimal backup policy for a hard computer disk depending on age under availability criterion
Computers & Mathematics with Applications | 1993-04-01 | Paper |
Optimal minimal-repair and replacement problem with age dependent cost structure
Computers & Mathematics with Applications | 1993-04-01 | Paper |
Primal-dual proximal point algorithm for linearly constrained convex programming problems
Computational Optimization and Applications | 1993-02-04 | Paper |
On the average optimality of circular assignment policy
Queueing Systems | 1993-01-17 | Paper |
A linear time algorithm for computing 3-edge-connected components in a multigraph
Japan Journal of Industrial and Applied Mathematics | 1993-01-16 | Paper |
On Onaga's upper bound on the mean values of probabilistic maximum flows
IEEE Transactions on Reliability | 1993-01-16 | Paper |
DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
Journal of the Operations Research Society of Japan | 1992-09-26 | Paper |
| scientific article; zbMATH DE number 43711 (Why is no real title available?) | 1992-09-17 | Paper |
Counting the number of minimum cuts in undirected multigraphs
IEEE Transactions on Reliability | 1992-06-28 | Paper |
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
SIAM Journal on Discrete Mathematics | 1992-06-28 | Paper |
Optimal strategies for some team games
Discrete Applied Mathematics | 1992-06-28 | Paper |
A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
Algorithmica | 1992-06-28 | Paper |
Successive linearization methods for large-scale nonlinear programming problems
Japan Journal of Industrial and Applied Mathematics | 1992-06-28 | Paper |
Maximum flows in probabilistic networks
Networks | 1992-06-27 | Paper |
An algorithm for the fair resource allocation problem with a submodular constraint
Japan Journal of Industrial and Applied Mathematics | 1992-06-27 | Paper |
Chain packing in graphs
Algorithmica | 1991-01-01 | Paper |
Multicommodity flows in certain planar directed networks
Discrete Applied Mathematics | 1990-01-01 | Paper |
Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
Networks | 1990-01-01 | Paper |
Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices
Mathematics of Operations Research | 1990-01-01 | Paper |
An Efficient Trust Region Algorithm for Minimizing Nondifferentiable Composite Functions
SIAM Journal on Scientific and Statistical Computing | 1989-01-01 | Paper |
On max-flow min-cut and integral flow properties for multicommodity flows in directed networks
Information Processing Letters | 1989-01-01 | Paper |
INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
Journal of the Operations Research Society of Japan | 1989-01-01 | Paper |
On generalized pseudoconvex functions
Journal of Mathematical Analysis and Applications | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4164874 (Why is no real title available?) | 1988-01-01 | Paper |
A globally convergent SQP method for semi-infinite nonlinear optimization
Journal of Computational and Applied Mathematics | 1988-01-01 | Paper |
AN ITERATIVE METHOD FOR VARIATIONAL INEQUALITIES WITH APPLICATION TO TRAFFIC EQUILIBRIUM PROBLEMS
Journal of the Operations Research Society of Japan | 1988-01-01 | Paper |
A comparative study of several semi-infinite nonlinear programming algorithms
European Journal of Operational Research | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4064435 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4049147 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4052864 (Why is no real title available?) | 1987-01-01 | Paper |
Approximation algorithms for combinatorial fractional programming problems
Mathematical Programming | 1987-01-01 | Paper |
A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
Discrete Applied Mathematics | 1987-01-01 | Paper |
A cautious scheduler for multistep transactions
Algorithmica | 1987-01-01 | Paper |
Distances defined by neighborhood sequences
Pattern Recognition | 1986-01-01 | Paper |
A generalization of alpha-beta and SSS^* search procedures
Artificial Intelligence | 1986-01-01 | Paper |
Strong unimodularity for matrices and hypergraphs
Discrete Applied Mathematics | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3965816 (Why is no real title available?) | 1985-01-01 | Paper |
An efficient algorithm for the parametric resource allocation problem
Discrete Applied Mathematics | 1985-01-01 | Paper |
An Algorithm for the Equipollent Resource Allocation Problem
Mathematics of Operations Research | 1985-01-01 | Paper |
Cautious transaction schedulers with admission control
ACM Transactions on Database Systems | 1985-01-01 | Paper |
Fractional programming
European Journal of Operational Research | 1983-01-01 | Paper |
Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
Management Science | 1983-01-01 | Paper |
Parametric approaches to fractional programs
Mathematical Programming | 1983-01-01 | Paper |
A polynomial time algorithm for a chance-constrained single machine scheduling problem
Operations Research Letters | 1983-01-01 | Paper |
On-line computation of transitive closures of graphs
Information Processing Letters | 1983-01-01 | Paper |
Design of Minimum-Cost Deadlock-Free Systems
Journal of the ACM | 1983-01-01 | Paper |
Bin packing and multiprocessor scheduling problems with side constraint on job types
Discrete Applied Mathematics | 1983-01-01 | Paper |
Deadlock-Free Systems for a Bounded Number of Processes
IEEE Transactions on Computers | 1982-01-01 | Paper |
THE POWER OF UPPER AND LOWER BOUNDING FUNCTIONS IN BRANCH-AND-BOUND ALGORITHMS
Journal of the Operations Research Society of Japan | 1982-01-01 | Paper |
An efficient algorithm for K shortest simple paths
Networks | 1982-01-01 | Paper |
Threshold Sequences
SIAM Journal on Algebraic Discrete Methods | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3848997 (Why is no real title available?) | 1981-01-01 | Paper |
An Algorithm for Finding <i>K</i> Minimum Spanning Trees
SIAM Journal on Computing | 1981-01-01 | Paper |
On Minimal Test Sets for Locating Single Link Failures in Networks
IEEE Transactions on Computers | 1981-01-01 | Paper |
An Algorithm for the <i>K</i> Best Solutions of the Resource Allocation Problem
Journal of the ACM | 1981-01-01 | Paper |
Sufficient Conditions for Graphs to Have Threshold Number 2
North-Holland Mathematics Studies | 1981-01-01 | Paper |
Threshold Numbers and Threshold Completions
North-Holland Mathematics Studies | 1981-01-01 | Paper |
Threshold Numbers and Threshold Completions
Combinatorics 79 | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3666532 (Why is no real title available?) | 1980-01-01 | Paper |
APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS
Journal of the Operations Research Society of Japan | 1980-01-01 | Paper |
The number of additional variables required for the integer programming formulation
Discrete Applied Mathematics | 1980-01-01 | Paper |
Notes on the Problem of the Allocation of Resources to Activities in Discrete Quantities
The Journal of the Operational Research Society | 1980-01-01 | Paper |
A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function
The Journal of the Operational Research Society | 1979-01-01 | Paper |
PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
Journal of the Operations Research Society of Japan | 1979-01-01 | Paper |
ALGORITHMS FOR A VARIANT OF THE RESOURCE ALLOCATION PROBLEM
Journal of the Operations Research Society of Japan | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3648761 (Why is no real title available?) | 1978-01-01 | Paper |
THE MULTIPLE-CHOICE KNAPSACK PROBLEM
Journal of the Operations Research Society of Japan | 1978-01-01 | Paper |
A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
Operations Research | 1978-01-01 | Paper |
Branch-and-bound procedure and state—space representation of combinatorial optimization problems
Information and Control | 1978-01-01 | Paper |
Depth-m search in branch-and-bound algorithms
International Journal of Computer & Information Sciences | 1978-01-01 | Paper |
Finite automata having cost functions: Nondeterministic models
Information and Control | 1978-01-01 | Paper |
The Power of Dominance Relations in Branch-and-Bound Algorithms
Journal of the ACM | 1977-01-01 | Paper |
Fractional knapsack problems
Mathematical Programming | 1977-01-01 | Paper |
ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS
Journal of the Operations Research Society of Japan | 1977-01-01 | Paper |
On the optimality of algorithms for finite state sequential decision processes
Journal of Mathematical Analysis and Applications | 1976-01-01 | Paper |
ALGORITHMS FOR QUADRATIC FRACTIONAL PROGRAMMING PROBLEMS
Journal of the Operations Research Society of Japan | 1976-01-01 | Paper |
A PRIMAL CUTTING PLANE ALGORITHM FOR INTEGER FRACTIONAL PROGRAMMING PROBLEMS
Journal of the Operations Research Society of Japan | 1976-01-01 | Paper |
AN ASSIGNMENT PROBLEM ON A NETWORK
Journal of the Operations Research Society of Japan | 1976-01-01 | Paper |
Integer programming formulation of combinatorial optimization problems
Discrete Mathematics | 1976-01-01 | Paper |
Theoretical comparisons of search strategies in branch-and-bound algorithms
International Journal of Computer & Information Sciences | 1976-01-01 | Paper |
Computational Efficiency of Approximate Branch-and-Bound Algorithms
Mathematics of Operations Research | 1976-01-01 | Paper |
Finite automata having cost functions
Information and Control | 1976-01-01 | Paper |
Minimal representations of some classes of dynamic programming
Information and Control | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3550466 (Why is no real title available?) | 1974-01-01 | Paper |
Comments on "Monotone Functions in Sequential Circuits"
IEEE Transactions on Computers | 1974-01-01 | Paper |
Classes of discrete optimization problems and their decision problems
Journal of Computer and System Sciences | 1974-01-01 | Paper |
Algorithms for Obtaining Shortest Paths Visiting Specified Nodes
SIAM Review | 1973-01-01 | Paper |
Technical Note—The Use of Cuts in Complementary Programming
Operations Research | 1973-01-01 | Paper |
Solvable classes of discrete dynamic programming
Journal of Mathematical Analysis and Applications | 1973-01-01 | Paper |
Finite State Representations of Discrete Optimization Problems
SIAM Journal on Computing | 1973-01-01 | Paper |
Fail-safe realization of sequential machines
Information and Control | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3393932 (Why is no real title available?) | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3366469 (Why is no real title available?) | 1972-01-01 | Paper |
Design of Optimal Switching Networks by Integer Programming
IEEE Transactions on Computers | 1972-01-01 | Paper |
N-Fail-Safe Sequential Machines
IEEE Transactions on Computers | 1972-01-01 | Paper |
Representation theorems for equivalent optimization problems
Information and Control | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3380419 (Why is no real title available?) | 1971-01-01 | Paper |
Technical Note—Complementary Programming
Operations Research | 1971-01-01 | Paper |
Synthesis of Networks with a Minimum Number of Negative Gates
IEEE Transactions on Computers | 1971-01-01 | Paper |
Technical Note—Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks
Operations Research | 1971-01-01 | Paper |
Gate-Interconnection Minimization of Switching Networks Using Negative Gates
IEEE Transactions on Computers | 1971-01-01 | Paper |
Adaptive Linear Classifier by Linear Programming
IEEE Transactions on Systems Science and Cybernetics | 1970-01-01 | Paper |
| scientific article; zbMATH DE number 3314811 (Why is no real title available?) | 1969-01-01 | Paper |
On Autonomous Logic Nets of Threshold Elements
IEEE Transactions on Computers | 1968-01-01 | Paper |
A Theory of Completely Monotonic Functions and its Applications to Threshold Logic
IEEE Transactions on Computers | 1968-01-01 | Paper |
Realization of Arbitrary Logic Functions by Completely Monotonic Functions and Its Applications to Threshold Logic
IEEE Transactions on Computers | 1968-01-01 | Paper |
A Lower Bound of the Number of Threshold Functions
IEEE Transactions on Electronic Computers | 1965-01-01 | Paper |
