Search

Your search keyword '"Walkup D"' showing total 227 results

Search Constraints

Start Over You searched for: Author "Walkup D" Remove constraint Author: "Walkup D"
227 results on '"Walkup D"'

Search Results

1. The influence of electron-doping on the ground state of (Sr{1-x}La{x})2IrO4

2. First-order melting of a weak spin-orbit Mott insulator into a correlated metal

3. Ripple modulated electronic structure of a 3D topological insulator

4. Visualizing Landau levels of Dirac electrons in a one dimensional potential

5. One-dimensional channel for Dirac electrons in a 3D topological insulator

6. A quantum ruler for orbital magnetism in moiré quantum matter

10. Observation of Dirac Node Formation and Mass Acquisition in a Topological Crystalline Insulator

15. E2205

16. Influence of electron doping on the ground state of(Sr1−xLax)2IrO4

22. A generalized lower-bound conjecture for simplicial polytopes.

24. CAVAP, A FORTRAN SUBROUTINE FOR SOLVING AN ASSIGNMENT PROBLEM WITH CONCAVE OBJECTIVE

25. ON A BRANCH-AND-BOUND METHOD FOR SEPARABLE CONCAVE PROGRAMS.

26. SUFFICIENT CONDITIONS FOR ASSOCIATION OF BINARY VARIABLES

27. A MULTIVARIATE NOTION OF ASSOCIATION, WITH A RELIABILITY APPLICATION

28. ORDER-PRESERVING FUNCTIONS; APPLICATIONS TO MAJORIZATION AND ORDER STATISTICS

29. A MULTIVARIATE NOTION OF ASSOCIATION FOR GENERAL RANDOM VARIABLES

30. Mathematical Notes

31. Mathematical Notes

32. Influence of electron doping on the ground state of (Sr1-xLax)2IrO4.

33. Influence of electron doping on the ground state of (Sr1-xLax)2IrO4.

34. Quadratic knapsack problems

35. Weakly admissible transformations for solving algebraic assignment and transportation problems

36. Worst case analysis of greedy type algorithms for independence systems

37. A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation

38. A technique for determining blocking and anti-blocking polyhedral descriptions

39. Polynomial bounding for NP-hard problems

40. On the symmetric travelling salesman problem: A computational study

41. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study

42. On the symmetric travelling salesman problem: Solution of a 120-city problem

43. Cutting planes from conditional bounds: A new approach to set covering

44. Dual integrality in b-matching problems

45. Certain kinds of polar sets and their relation to mathematical programming

46. Fractional vertices, cuts and facets of the simple plant location problem

47. Colouring criteria for adjacency on 0–1-polyhedra

48. Balanced matrices and property (G)

49. Preliminary airplane design aided by mathematical optimization

50. Mathematical programming and the optimization of computer simulations

Catalog

Books, media, physical & digital resources