Abstract: A machine learning algorithm is trained to learn to cluster a plurality of original-destination routes in a network for transporting cargo into a plurality of clusters based on similarities of the original-destination routes, and to learn to cluster the plurality of clusters into a plurality of subgroups based on customer behavior. Influencing criteria associated with each of the subgroups may be determined and based on the influencing criteria, a price elasticity curve for each of the subgroups may be generated. Based on the price elasticity curve and current network traffic, cargo transportation price associated with each of the subgroups may be determined.

Abstract: Systems, methods, and computer-readable media are disclosed for identifying product configurations that are alternatives to a requested product configuration, ranking the alternative product configurations based on one or more pricing metrics, and presenting the alternative product configurations to a prospective customer, thereby providing the customer with the option of selecting an alternative product configuration in lieu of the initially requested product configuration.

Abstract: A system that compresses data during neural network training. A memory stores computer executable components and neural network data, and a processor executes computer executable components stored in the memory. An anticipatory value of inventory (VOI) optimization component calculates optimal VOI and prices for immediate-future inventory levels in parallel and writes latest price updates for respective states to a price stack; and a recommendation component provides customized pricing recommendation for a product relative to a unique customer as a function of the latest price updates for respective states to the price stack.

Abstract: System and method that improves cargo logistics may be presented. For instance, shipping capacity in cargo logistics may be best utilized based on providing pricing and scheduling solutions that are jointly optimized and prices differentiated based on flexibility of service request. Scheduled service and pricing may be transmitted as a signal to control execution of the cargo logistics.

Abstract: A system that compresses data during neural network training. A memory stores computer executable components and neural network data, and a processor executes computer executable components stored in the memory. An anticipatory value of inventory (VOI) optimization component calculates optimal VOI and prices for immediate-future inventory levels in parallel and writes latest price updates for respective states to a price stack; and a recommendation component provides customized pricing recommendation for a product relative to a unique customer as a function of the latest price updates for respective states to the price stack.

Abstract: A machine learning algorithm is trained to learn to cluster a plurality of original-destination routes in a network for transporting cargo into a plurality of clusters based on similarities of the original-destination routes, and to learn to cluster the plurality of clusters into a plurality of subgroups based on customer behavior. Influencing criteria associated with each of the subgroups may be determined and based on the influencing criteria, a price elasticity curve for each of the subgroups may be generated. Based on the price elasticity curve and current network traffic, cargo transportation price associated with each of the subgroups may be determined.

Abstract: An algebra and differential equations model of a physical system is constructed based on available training data and physical system characteristics. A hybrid calibration process is carried out to iteratively calibrate both time-insensitive and time-sensitive parameters of the algebra and differential equations model so as to obtain parameter vectors. Vector auto-regression is applied to the parameter vectors to predict values of the parameters for a future time period.

Abstract: A machine learning algorithm is trained to learn to cluster a plurality of original-destination routes in a network for transporting cargo into a plurality of clusters based on similarities of the original-destination routes, and to learn to cluster the plurality of clusters into a plurality of subgroups based on customer behavior. Influencing criteria associated with each of the subgroups may be determined and based on the influencing criteria, a price elasticity curve for each of the subgroups may be generated. Based on the price elasticity curve and current network traffic, cargo transportation price associated with each of the subgroups may be determined.

Abstract: An algebra and differential equations model of a physical system is constructed based on available training data and physical system characteristics. A hybrid calibration process is carried out to iteratively calibrate both time-insensitive and time-sensitive parameters of the algebra and differential equations model so as to obtain parameter vectors. Vector auto-regression is applied to the parameter vectors to predict values of the parameters for a future time period.

Abstract: User information may be received and a market segment associated with the user may be received. A personalized or individualized offer may be determined based on the user information, the personalized offer determined based on a product offeror's goal with respect to the user at a given time. The market segment offer and the personalized offer may be blended to determine a recommended personalized offering for the user at the given time, e.g., given a company's tactical, strategic and lifetime goals and values for that user.

Abstract: Systems, methods, and computer-readable media are disclosed for identifying product configurations that are alternatives to a requested product configuration, ranking the alternative product configurations based on one or more pricing metrics, and presenting the alternative product configurations to a prospective customer, thereby providing the customer with the option of selecting an alternative product configuration in lieu of the initially requested product configuration.

Abstract: A machine learning algorithm is trained to learn to cluster a plurality of original-destination routes in a network for transporting cargo into a plurality of clusters based on similarities of the original-destination routes, and to learn to cluster the plurality of clusters into a plurality of subgroups based on customer behavior. Influencing criteria associated with each of the subgroups may be determined and based on the influencing criteria, a price elasticity curve for each of the subgroups may be generated. Based on the price elasticity curve and current network traffic, cargo transportation price associated with each of the subgroups may be determined.

Abstract: System and method that improves cargo logistics may be presented. For instance, shipping capacity in cargo logistics may be best utilized based on providing pricing and scheduling solutions that are jointly optimized and prices differentiated based on flexibility of service request. Scheduled service and pricing may be transmitted as a signal to control execution of the cargo logistics.

Abstract: A hardware processor coupled to a transaction data database and a customer data database receives transaction data and customer data, and executes a predictive modeling algorithm that determines customer features that characterize purchasing behavior from the customer data and the transaction data. The hardware processor executes a clustering algorithm that segments customers into multiple groups based on the customer features. A likelihood function is constructed based on a selected demand model, the transaction data and customer segment information determined from the multiple groups, the likelihood function determined based on probability that each sales transaction belongs to a segment conditioned on a paid price. A model estimator computes parameters that maximize the likelihood function.

Abstract: An aspect of the disclosure includes a method, a system and a computer program product for determining a personalized bundle offer for a consumer. The method includes determining an interest in an initial product by a consumer. A demand group is identified based on the initial product. A purchase probability is determined for the consumer to purchase the product. An inventory expected profit-to-go is determined for the product. At least one additional product from the demand group is determined based at least in part on the purchase probability and the inventory expected profit-to-go, the expected profit to go being based on a current inventory state of the product and the at least one additional product. A signal is transmitted to the consumer, the signal including at least one additional product and a price for a bundle containing both the product of interest and the at least one additional product.

Abstract: Embodiments are directed to a computer implemented method of generating inventory valuation data for an omnichannel (OC) retail operation. The method starts with an unsolvable OC nonlinear nonconvex problem, applies transformations to generate a mixed-integer program (MIP) that is a tractable linear nonconvex form, solves the MIP, fixes prices at optimal values to achieve dimensionality reduction and eliminate all non-convexity by eliminating the pricing dimension. The method further obtains inventory flow linear programming (LP) that is linear convex, and solves the LP to recover a dual solution as initial inventory valuations.

Abstract: User information may be received and a market segment associated with the user may be received. A personalized or individualized offer may be determined based on the user information, the personalized offer determined based on a product offeror's goal with respect to the user at a given time. The market segment offer and the personalized offer may be blended to determine a recommended personalized offering for the user at the given time, e.g., given a company's tactical, strategic and lifetime goals and values for that user.

Abstract: Training a machine to learn to offer personalized promotions over a network is provided. A promotion optimization engine may take logit models and their confidence measures, and compute the acceptance probability of each promotion based on the customer and product features. A target promotion may be determined based on an objective function, which jointly considers the acceptance probability and the logit model's confidence level. A cognitive engine receives a user response to the promotion and based on the user response, updates parameters of the logit model and confidence level associated with the logit model. In one aspect, a signal to offer the promotion is transmitted via a communication channel to a user's device, wherein the signal causes the user's device to automatically connect to one or more of the processors to receive the promotion, e.g., when the user's device is online.

Abstract: In one embodiment, a computer-implemented method includes receiving historical transaction data related to a product. A demand model is calibrated to forecast demand for each of one or more zones and each of one or more channels over which the product is sold. A time-and-virtual-space (TVS) network is constructed, by a computer processor, to include one or more supply nodes and one or more sink nodes. Each of the supply nodes represents inventory of the product at a corresponding physical location, and each of the sink nodes represents a calibrated demand for the product. Based on the TVS network, a low-cost plan is determined for an omni-channel retail environment. The low-cost plan specifies at least one of allocation of the product across physical stores, partitioning of the inventory of the product for virtual sales, and pricing of the product.

Abstract: In one embodiment, a computer-implemented method includes receiving historical transaction data related to a product. A demand model is calibrated to forecast demand for each of one or more zones and each of one or more channels over which the product is sold. A time-and-virtual-space (TVS) network is constructed, by a computer processor, to include one or more supply nodes and one or more sink nodes. Each of the supply nodes represents inventory of the product at a corresponding physical location, and each of the sink nodes represents a calibrated demand for the product. Based on the TVS network, a low-cost plan is determined for an omni-channel retail environment. The low-cost plan specifies at least one of allocation of the product across physical stores, partitioning of the inventory of the product for virtual sales, and pricing of the product.