Keyword: complexity

Found 45 papers in total
Complexity Results and Exact Algorithms for Robust Knapsack Problems
Complexity Results and Exact Algorithms for Robust Knapsack Problems
2014,
This paper studies the robust knapsack problem, for which solutions are, up to a...
A New Complexity Analysis for Full-Newton Step Infeasible Interior-Point Algorithm for Horizontal Linear Complementarity Problems
A New Complexity Analysis for Full-Newton Step Infeasible Interior-Point Algorithm for Horizontal Linear Complementarity Problems
2014,
In this paper, we first present a full‐Newton step feasible...
A review of supply chain complexity drivers
A review of supply chain complexity drivers
2013,
Studies on supply chain complexity mainly use the static and dynamic complexity...
Comparison of task complexity measures for emergency operating procedures: Convergent validity and predictive validity
Comparison of task complexity measures for emergency operating procedures: Convergent validity and predictive validity
2014,
Human performance while executing operating procedures is critically important for the...
On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem
On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem
2014,
The travelling salesman problem (TSP) is one of the most prominent NP‐hard...
Parameterized Complexity of Eulerian Deletion Problems
Parameterized Complexity of Eulerian Deletion Problems
2014,
We study a family of problems where the goal is to make a graph Eulerian, i.e.,...
Complexity of solution structures in nonlinear pricing
Complexity of solution structures in nonlinear pricing
2013,
This paper characterizes and enumerates the possible solution structures in nonlinear...
Black‐Box Search by Unbiased Variation
Black‐Box Search by Unbiased Variation
2012,
The complexity theory for black‐box algorithms, introduced by Droste, Jansen,...
Computational complexity of iterated maps on the interval
Computational complexity of iterated maps on the interval
2012,
The correct computation of orbits of discrete dynamical systems on the interval is...
Product portfolio architectural complexity and operational performance: Incorporating the roles of learning and fixed assets
Product portfolio architectural complexity and operational performance: Incorporating the roles of learning and fixed assets
2011,
Managers struggle to cope with complexity in their product portfolios. However,...
Model‐based identification and use of task complexity factors of human integrated systems
Model‐based identification and use of task complexity factors of human integrated systems
2012,
Task complexity is one of the conceptual constructs that are critical to explain and...
Unravelling the dynamics of knowledge creation in communities of practice though complexity theory lenses
Unravelling the dynamics of knowledge creation in communities of practice though complexity theory lenses
2011,
Drawing on a longitudinal case study of Alpha Chemicals, we use four complexity theory...
A method for analysing operational complexity in supply chains
A method for analysing operational complexity in supply chains
2013,
This paper proposes a method for analysing the operational complexity in supply chains...
On the complexity of problems on simple games
On the complexity of problems on simple games
2011,
Simple games cover voting systems in which a single alternative, such as a bill or an...
Complexity and approximation of an area packing problem
Complexity and approximation of an area packing problem
2012,
Motivated by an application in mobile telecommunication systems, we investigate a...
Complexity analysis and optimization of the shortest path tour problem
Complexity analysis and optimization of the shortest path tour problem
2012,
The shortest path tour problem (SPTP) consists in finding a shortest path from a given...
Global Complexity Bound Analysis of the Levenberg–Marquardt Method for Nonsmooth Equations and Its Application to the Nonlinear Complementarity Problem
Global Complexity Bound Analysis of the Levenberg–Marquardt Method for Nonsmooth Equations and Its Application to the Nonlinear Complementarity Problem
2012,
We investigate a global complexity bound of the Levenberg–Marquardt Method (LMM)...
Complexity of Finding Graph Roots with Girth Conditions
Complexity of Finding Graph Roots with Girth Conditions
2012,
Graph G is the square of graph H if two vertices x , y have an edge in G if and only...
Stronger Lempel‐Ziv Based Compressed Text Indexing
Stronger Lempel‐Ziv Based Compressed Text Indexing
2012,
Given a text T [1.. u ] over an alphabet of size σ , the full‐text search...
Splitting a Delaunay Triangulation in Linear Time
Splitting a Delaunay Triangulation in Linear Time
2002,
Computing the Delaunay triangulation of n points requires usually a minimum of...
Realistic Input Models for Geometric Algorithms
Realistic Input Models for Geometric Algorithms
2002,
The traditional worst‐case analysis often fails to predict the actual behavior...
An efficient algorithm for maximal margin clustering
An efficient algorithm for maximal margin clustering
2012,
Maximal margin based frameworks have emerged as a powerful tool for supervised...
The Complexity of König Subgraph Problems and Above‐Guarantee Vertex Cover
The Complexity of König Subgraph Problems and Above‐Guarantee Vertex Cover
2011,
A graph is König‐Egerváry if the size of a minimum vertex cover...
Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
2012,
This paper describes new models and exact solution algorithms for the fixed...
Papers per page: