The following pages link to Louis Caccetta (Q328466):
Displaying 50 items.
- (Q255977) (redirect page) (← links)
- Global well-posedness of the non-isentropic full compressible magnetohydrodynamic equations (Q255978) (← links)
- Practical exponential set stabilization for switched nonlinear systems with multiple subsystem equilibria (Q276514) (← links)
- The non-convex sparse problem with nonnegative constraint for signal reconstruction (Q328467) (← links)
- Optimal pricing and production planning for multi-product multi-period systems with backorders (Q378274) (← links)
- Dampening bullwhip effect of order-up-to inventory strategies via an optimal control method (Q380348) (← links)
- Entire large solutions for a class of Schrödinger systems with a nonlinear random operator (Q472370) (← links)
- Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration (Q478929) (← links)
- Computational models for timetabling problem (Q478951) (← links)
- Optimisation modelling of cancer growth (Q523976) (← links)
- \(Z\)-eigenvalue inclusion theorems for tensors (Q523981) (← links)
- A globally and quadratically convergent method for absolute value equations (Q626654) (← links)
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres (Q721466) (← links)
- An MILP approach to multi-location, multi-period equipment selection for surface mining with case studies (Q747008) (← links)
- Long cycles in graphs with large degree sums (Q749553) (← links)
- Cycles of given length in some \(K_{1,3}\)-free graphs (Q749554) (← links)
- (Q793643) (redirect page) (← links)
- The absolute centre of a graph (Q793644) (← links)
- A simple version of Karzanov's blocking flow algorithm (Q795064) (← links)
- Short cycles in directed graphs (Q797594) (← links)
- Integer linear programming formulation for a vehicle routing problem (Q804473) (← links)
- Cubic and quadruple Paley graphs with the \(n\)-e.c. property (Q860460) (← links)
- A characterization of maximal non-\(k\)-factor-critical graphs (Q861799) (← links)
- Computational aspects of the optimal transit path problem (Q999233) (← links)
- The \(SC^1\) 1property of an expected residual function arising from stochastic complementarity problems (Q1003495) (← links)
- Feasible semismooth Newton method for a class of stochastic linear complementarity problems (Q1014020) (← links)
- Cyclic one-factorization of the complete graph (Q1092066) (← links)
- An application of discrete mathematics in the design of an open pit mine (Q1110451) (← links)
- A simple way to tell a simple polytope from its graph (Q1120602) (← links)
- On diameter critical graphs (Q1132894) (← links)
- A note on line digraphs and the directed max-cut problem (Q1174433) (← links)
- A sufficient condition for graphs to be weakly \(k\)-linked (Q1180674) (← links)
- Self-orthogonal Hamilton path decompositions (Q1183991) (← links)
- The traveling salesman problem in graphs with some excluded minors (Q1184343) (← links)
- Graphs of maximum diameter (Q1193709) (← links)
- Extremal graphs of diameter 4 (Q1213888) (← links)
- A new subtour elimination constraint for the vehicle routing problem (Q1278251) (← links)
- Edge maximal non-bipartite graphs without odd cycles of prescribed lengths (Q1348667) (← links)
- Binary labeling of graphs (Q1359371) (← links)
- Matching extension and minimum degree (Q1363649) (← links)
- An application of branch and cut to open pit mine scheduling (Q1407258) (← links)
- On a problem concerning ordered colourings (Q1584394) (← links)
- A macro traffic flow model accounting for real-time traffic state (Q1618695) (← links)
- Global well-posedness and blow-up for the Hartree equation (Q1752072) (← links)
- A positive linear discrete-time model of capacity planning and its controllability properties (Q1764970) (← links)
- Forced oscillation of a class of neutral hyperbolic differential equations (Q1775589) (← links)
- Parameter selection for nonnegative $l_1$ matrix/tensor sparse decomposition (Q1785395) (← links)
- Numerical solution of optimal control problems with discrete-valued system parameters (Q1864786) (← links)
- Solving the multisensor data association problem. (Q1875608) (← links)
- Computational aspects of hard knapsack problems. (Q1875611) (← links)
