The following pages link to Efstratios Rappos (Q590170):
Displaying 50 items.
- Error bounds for mixed integer linear optimization problems (Q263186) (← links)
- The convex recoloring problem: polyhedra, facets and computational experiments (Q263202) (← links)
- Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization (Q263209) (← links)
- Total variation bounds on the expectation of periodic functions with applications to recourse approximations (Q291034) (← links)
- What's in \textit{YOUR} wallet? (Q297491) (← links)
- Some differential estimates in linear programming (Q300656) (← links)
- Counting the number of round-robin tournament schedules (Q301476) (← links)
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (Q304240) (← links)
- Duality for mixed-integer convex minimization (Q304264) (← links)
- Network-oriented modeling. Addressing complexity of cognitive, affective and social interactions (Q341063) (← links)
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem (Q378087) (← links)
- Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
- The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods (Q431227) (← links)
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- Strategic interactions in service supply chain with horizontal competition (Q456911) (← links)
- The reverse self-dual serial cost-sharing rule (Q456927) (← links)
- Belief propagation for optimal edge cover in the random complete graph (Q473162) (← links)
- Optimization models in a transition economy (Q476784) (← links)
- Spectral characterization of families of split graphs (Q489341) (← links)
- A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming (Q493049) (← links)
- An infeasible full-NT step interior point algorithm for CQSCO (Q503355) (← links)
- Privacy and counterfeit coins (Q517889) (← links)
- Optimization in engineering. Models and algorithms (Q526617) (← links)
- Two-step modulus-based matrix splitting iteration method for linear complementarity problems (Q535254) (← links)
- Locating a nearest matrix with an eigenvalue of prespecified algebraic multiplicity (Q537877) (← links)
- Collaborative planning with confidentiality (Q540688) (← links)
- Warranty data collection and analysis. (Q545900) (← links)
- Evaluating returns to scale and congestion by production possibility set in intersection form (Q547402) (← links)
- Evolution of a time dependent Markov model for training and recruitment decisions in manpower planning (Q603127) (← links)
- Convergence of a continuous approach for zero-one programming problems (Q621018) (← links)
- Fréchet distance with speed limits (Q621928) (← links)
- Approximate inclusion-exclusion for arbitrary symmetric functions (Q626621) (← links)
- Solvability of Newton equations in smoothing-type algorithms for the SOCCP (Q629483) (← links)
- Combining nonmonotone conic trust region and line search techniques for unconstrained optimization (Q629507) (← links)
- Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems (Q630020) (← links)
- Graphs and cubes (Q636729) (← links)
- Computation of approximate optimal policies in a partially observed inventory model with rain checks (Q642900) (← links)
- Contract theory in continuous-time models (Q663167) (← links)
- Competing for talents (Q694731) (← links)
- Directed search and optimal production (Q694735) (← links)
- A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming (Q732375) (← links)
- A new smoothing Newton-type method for second-order cone programming problems (Q734859) (← links)
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step (Q734862) (← links)
- The Cholesky factorization in interior point methods (Q815247) (← links)
- Finite element approximations to surfaces of prescribed variable mean curvature (Q818791) (← links)
- Evaluation and decision models with multiple criteria. Stepping stones for the analyst. (Q820231) (← links)
- A short proof for stronger version of DS decomposition in set function optimization (Q830927) (← links)
- A filter SQP algorithm without a feasibility restoration phase (Q843266) (← links)
- Economic design of an inventory policy for non-instantaneous deteriorating items under permissible delay in payments (Q847228) (← links)
- Optimal partition of a large labor force into working pairs (Q847812) (← links)
