Pages that link to "Item:Q3892021"
From MaRDI portal
The following pages link to Production Sets with Indivisibilities, Part I: Generalities (Q3892021):
Displaying 21 items.
- A fixed point iterative approach to integer programming and its distributed computation (Q288180) (← links)
- The combinatorics of modeling and analyzing biological systems (Q553904) (← links)
- Computing efficiently the lattice width in any dimension (Q638564) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Input, output and graph technical efficiency measures on non-convex FDH models with various scaling laws: An integrated approach based upon implicit enumeration algorithms (Q874886) (← links)
- General equilibrium theory and increasing returns (Q1110428) (← links)
- Test sets of integer programs (Q1298753) (← links)
- The complex of maximal lattice free simplices (Q1337134) (← links)
- Test sets for integer programs (Q1365062) (← links)
- The topological structure of maximal lattice free convex bodies: The general case (Q1380933) (← links)
- Existence and welfare properties of equilibrium in an exchange economy with multiple divisible and indivisible commodities and linear production technologies (Q1601454) (← links)
- Replication and returns to scale in production (Q1674983) (← links)
- Global and local scale characteristics in convex and nonconvex nonparametric technologies: a first empirical exploration (Q1751850) (← links)
- A linear algorithm for integer programming in the plane (Q1771307) (← links)
- Proportionate progress: A notion of fairness in resource allocation (Q1918992) (← links)
- Competitive equilibria in economies with multiple indivisible and multiple divisible commodities (Q2495377) (← links)
- Minimizing cubic and homogeneous polynomials over integers in the plane (Q2806816) (← links)
- Efficient Lattice Width Computation in Arbitrary Dimension (Q3648771) (← links)
- The topological structure of maximal lattice free convex bodies: The general case (Q5101419) (← links)
- Computing an integer point of a class of convex sets. (Q5929418) (← links)
- Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm (Q5936075) (← links)
