The following pages link to Kurt O. Jørnsten (Q684334):
Displaying 50 items.
- (Q251146) (redirect page) (← links)
- A maximum entropy approach to the newsvendor problem with partial information (Q257256) (← links)
- (Q331784) (redirect page) (← links)
- Pricing combinatorial auctions by a set of linear price vectors (Q331786) (← links)
- Flow sharing and bankruptcy games (Q532705) (← links)
- (Q585077) (redirect page) (← links)
- Multicommodity network flows with conversions (Q585078) (← links)
- Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach (Q684336) (← links)
- (Q750287) (redirect page) (← links)
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing (Q750288) (← links)
- Cross decomposition applied to the stochastic transportation problem (Q799587) (← links)
- A facet generation and relaxation technique applied to an assignment problem with side constraints (Q810374) (← links)
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem (Q811344) (← links)
- The deregulated electricity market viewed as a bilevel programming problem (Q811888) (← links)
- Improved Lagrangean decomposition: An application to the generalized assignment problem (Q922948) (← links)
- Equilibrium prices supported by dual price functions in markets with non-convexities (Q928047) (← links)
- (Q976472) (redirect page) (← links)
- Cost allocation in collaborative forest transportation (Q976473) (← links)
- Quantification of preferences in markets (Q990284) (← links)
- Lower and upper bounds for linear production games (Q1027527) (← links)
- Non-linear anonymous pricing combinatorial auctions (Q1042137) (← links)
- A long range forestry planning problem with multiple objectives (Q1075245) (← links)
- An augmented Lagrangian approach to multi-commodity flow problems with conversions (Q1077322) (← links)
- A new Lagrangian relaxation approach to the generalized assignment problem (Q1088908) (← links)
- A note on the pivot and complement heuristic for 0-1 programming problems (Q1113801) (← links)
- Sequencing offshore oil and gas fields under uncertainty (Q1194729) (← links)
- Enhancing an algorithm for set covering problems (Q1194745) (← links)
- Resource constrained assignment problems (Q1264090) (← links)
- Convergence aspects of adaptive clustering in variable aggregation (Q1304489) (← links)
- Application of the scenario aggregation approach to a two-stage, stochastic, common component, inventory problem with a budget constraint (Q1308878) (← links)
- Aggregation and decomposition for multi-divisional linear programs (Q1319577) (← links)
- Partial cover and complete cover inequalities (Q1331885) (← links)
- On bicriterion minimal spanning trees: An approximation (Q1360130) (← links)
- Decomposition and iterative aggregation in hierarchical and decentralised planning structures (Q1390198) (← links)
- Revenue cap regulation in a deregulated electricity market -- effects on a grid company. (Q1412112) (← links)
- A pricing scheme for combinatorial auctions based on bundle sizes (Q1651618) (← links)
- The stable tournament problem: matching sports schedules with preferences (Q1728308) (← links)
- Critical objective function values in linear sum assignment problems (Q1743488) (← links)
- Statistical testing of bounded rationality with applications to the newsvendor model (Q1751803) (← links)
- An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
- Computing the nucleolus when the characteristic function is given implicitly: A constraint generation approach (Q1905053) (← links)
- On the nucleolus of the basic vehicle routing game (Q1919815) (← links)
- Cooperation of customers in traveling salesman problems with profits (Q2191292) (← links)
- Semi-Lagrangean approach for price discovery in markets with non-convexities (Q2275833) (← links)
- Incitements for transportation collaboration by cost allocation (Q2323429) (← links)
- Optimal solutions in the multi-location inventory system with transshipments (Q2369962) (← links)
- Common mistakes in computing the nucleolus (Q2629740) (← links)
- A Partitioning Method that Generates Interpretable Prices for Integer Programming Problems (Q2974424) (← links)
- Discrete-time optimal control of an economic system using different objective functions (Q3026853) (← links)
- (Q3142064) (← links)
